PushPush and Push-1 are NP-hard in 2D

We prove that two pushing-blocks puzzles are intractable in 2D. One of our constructions improves an earlier result that established intractability in 3D [OS99] for a puzzle inspired by the game PushPush. The second construction answers a question we raised in [DDO00] for a variant we call Push-1. Both puzzles consist of unit square blocks on an integer lattice; all blocks are movable. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover when a block is pushed it slides the maximal extent of its free range. In the Push-1 version, the agent can only push one block one square at a time, the minimal extent---one square. Both NP-hardness proofs are by reduction from SAT, and rely on a common construction.Comment: 10 pages, 11 figures. Corrects an error in the conference version: Proc. of the 12th Canadian Conference on Computational Geometry, August 2000, pp. 211-21

Vertex-Unfoldings of Simplicial Polyhedra

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have a disconnected interior: the triangles are connected at vertices, but not necessarily joined along edges.Comment: 10 pages; 7 figures; 8 reference

EFFICACY OF ELECTRON BEAM IRRADIATION OF PROCESSED PORK PRODUCTS

The research reported on in this paper was conducted as part of a larger project. That project is on-going and is focused on ascertaining if irradiation of processed meats would be effective and economical. It involved the examination, through modeling, of the irradiation of one of many currently produced ready-to-eat (RTE) convenience-oriented, value-added pork products, sliced boneless ham. The results and findings reported in this paper represent the initial estimates of the cost and potential profitability or economic viability of irradiation of processed meats. The results and findings in this paper should be considered preliminary with extension and verification to be reported in a later paper by the authors. The objective of the portion of that project reported on in this paper was to conduct cost analysis of alternative irradiation methods and to ascertain the cost of each of those methods. Three scenarios were considered for cost analysis. The first scenario was the installation of an X-ray irradiator at an existing meat processing plant. The second scenario was the installation of a Cobalt-60 irradiator at an existing meat processing plant. The third scenario assumed that the meat processor contracted for irradiation services from an off-site company providing such service to a number of clients. For purposes of this study it was assumed that irradiation of sliced boneless ham would result in either a $.06/pound reduction in costs from processor to consumer, a$.06/pound increase in willingness to pay [price] or an equivalent combination of reduced costs and increased price. Total cost per pound for the irradiation process applied to sliced boneless ham ranged from $0.008, at the 200 million pound annual throughput rate using Cobalt-60 irradiation, to$0.069 at the 50 million pound annual throughput rate when contracting with an off-site company.Food Consumption/Nutrition/Food Safety,

PushPush is NP-hard in 2D

We prove that a particular pushing-blocks puzzle is intractable in 2D, improving an earlier result that established intractability in 3D [OS99]. The puzzle, inspired by the game *PushPush*, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover, each block, when pushed, slides the maximal extent of its free range. We prove this version is NP-hard in 2D by reduction from SAT.Comment: 18 pages, 13 figures, 1 table. Improves cs.CG/991101

Enumerating Foldings and Unfoldings between Polygons and Polytopes

We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are, roughly: exponentially many, or nondenumerably infinite.Comment: 12 pages; 10 figures; 10 references. Revision of version in Proceedings of the Japan Conference on Discrete and Computational Geometry, Tokyo, Nov. 2000, pp. 9-12. See also cs.CG/000701

Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration questions in both directions: Given a polygon, how many foldings are there? Given a polytope, how many unfoldings are there to simple polygons? Throughout we give special attention to convex polygons, and to regular polygons. We show that every convex polygon folds to an infinite number of distinct polytopes, but that their number of combinatorially distinct gluings is polynomial. There are, however, simple polygons with an exponential number of distinct gluings. In the reverse direction, we show that there are polytopes with an exponential number of distinct cuttings that lead to simple unfoldings. We establish necessary conditions for a polytope to have convex unfoldings, implying, for example, that among the Platonic solids, only the tetrahedron has a convex unfolding. We provide an inventory of the polytopes that may unfold to regular polygons, showing that, for n>6, there is essentially only one class of such polytopes.Comment: 54 pages, 33 figure

Continuous Blooming of Convex Polyhedra

We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming.Comment: 13 pages, 6 figure

Luminous Intensity for Traffic Signals: A Scientific Basis for Performance Specifications

Humnan factors experiments on visual responses to simulated traffic signals using incandescent lamps and light-emitting diodes are described

Gyrofluid simulations of collisionless reconnection in the presence of diamagnetic effects

The effects of the ion Larmor radius on magnetic reconnection are investigated by means of numerical simulations, with a Hamiltonian gyrofluid model. In the linear regime, it is found that ion diamagnetic effects decrease the growth rate of the dominant mode. Increasing ion temperature tends to make the magnetic islands propagate in the ion diamagnetic drift direction. In the nonlinear regime, diamagnetic effects reduce the final width of the island. Unlike the electron density, the guiding center density does not tend to distribute along separatrices and at high ion temperature, the electrostatic potential exhibits the superposition of a small scale structure, related to the electron density, and a large scale structure, related to the ion guiding-center density

Gyrofluid simulations of collisionless reconnection in the presence of diamagnetic effects

The effects of the ion Larmor radius on magnetic reconnection are investigated by means of numerical simulations, with a Hamiltonian gyrofluid model. In the linear regime, it is found that ion diamagnetic effects decrease the growth rate of the dominant mode. Increasing ion temperature tends to make the magnetic islands propagate in the ion diamagnetic drift direction. In the nonlinear regime, diamagnetic effects reduce the final width of the island. Unlike the electron density, the guiding center density does not tend to distribute along separatrices and at high ion temperature, the electrostatic potential exhibits the superposition of a small scale structure, related to the electron density, and a large scale structure, related to the ion guiding-center density