Collision Detection for Moving Polyhedra by Canny, John

Get full text

Continuous Blooming of Convex Polyhedra by Demaine, Erik D., Demaine, Martin L., Hart, Vi, Iacono, John, Langerman, Stefan, O'Rourke, Joseph

“…We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. …”
Get full text
Get full text

Refold rigidity of convex polyhedra by Demaine, Erik D., Demaine, Martin L., Itoh, Jin-ichi, Lubiw, Anna, Nara, Chie, O'Rourke, Joseph

“…If the unfolding is restricted to cut only edges of the polyhedron, we identify several polyhedra that are “edge-refold rigid” in the sense that each of their unfoldings may only fold back to the original. …”
Get full text
Get full text

A Heterarchical Program for Recognition of Polyhedra by Shirai, Yoshiaki

Get full text

A Heterarchical Program for Recognition of Polyhedra by Shirai, Yoshiaki

“…Recognition of polyhedra by a heterarchical program is presented. …”
Get full text

An Approach to Three-Dimensional Decomposition and Description of Polyhedra by Hollerbach, John M.

Get full text

Shortest Paths, Network Design and Associated Polyhedra by Magnanti, Thomas L., Mirchandani, Prakash

Get full text

Capacitated Trees, Capacitated Routing, and Associated Polyhedra by Araque, Jésus Rafael, Hall, Leslie A., Magnanti, Thomas L.

“…For each of these problems, and for a forest relaxation of the minimal spanning tree problem, we introduce a number of new valid inequalities and specify conditions for ensuring when these inequalities are facets for the associated integer polyhedra. The inequalities are defined by one of several underlying support graphs: (i) a multistar, a "star" with a clique replacing the central vertex; (ii) a clique cluster, a collection of cliques intersecting at a single vertex, or more generally at a central" clique; and (iii) a ladybug, consisting of a multistar as a head and a clique as a body. …”
Get full text

A Generalization of the Source Unfolding of Convex Polyhedra by Demaine, Erik D., Lubiw, Anna

Get full text
Get full text

Continuously Flattening Polyhedra Using Straight Skeletons by Demaine, Erik D., Demaine, Martin L., Itoh, Jin-ichi, Lubiw, Anna, Nara, Chie, O'Rourke, Joseph, Abel, Zachary Ryan

“…We show that our method solves the fold-and-cut problem for convex polyhedra in any dimension. As an additional application, we show how a limiting form of our algorithm gives a general design technique for flat origami tessellations, for any spiderweb (planar graph with all-positive equilibrium stress).…”
Get full text
Get full text
Get full text

Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm by Damian, Mirela, Demaine, Erik D., Flatland, Robin

Get full text
Get full text

Prism Trees: An Efficient Representation for Manipulating and Displaying Polyhedra with Many Faces by Ponce, Jean

“…When dealing with polyhedra with many faces (typically more than one thousand), the first step is by far the most expensive. …”
Get full text

Tactile Recognition and Localization Using Object Models: The Case of Polyhedra on a Plane by Gaston, Peter C., Lozano-Perez, Tomaso

Get full text

Zipper unfolding of domes and prismoids by Demaine, Erik D., Demaine, Martin L., Uehara, Ryuhei

“…We study Hamiltonian unfolding—cutting a convex polyhedron along a Hamiltonian path of edges to unfold it without overlap—of two classes of polyhedra. Such unfoldings could be implemented by a single zipper, so they are also known as zipper edge unfoldings. …”
Get full text
Get full text

Hierarchical Shape Description of Objects by Selection and Modification of Prototypes by Hollerbach, John M.

“…An approach towards shape description, based on prototype modification and generalized cylinders, has been developed and applied to the object domains pottery and polyhedra: (1) A program describes and identifies pottery from vase outlines entered as lists of points. …”
Get full text

Spatial Planning: A Configuration Space Approach by Lozano-Perez, Tomas

“…The paper presents algorithms for computing these Configuration Space obstacles when the objects and obstacles are polygons or polyhedra. An approximation technique for high-dimensional Configuration Space obstacles, based on projections of obstacles slices, is described.…”
Get full text

Generating Semantic Descriptions From Drawings of Scenes With Shadows by Waltz, David L.

“…The computer programs involved look at scenes which consist of polyhedra and which may contain shadows and various kinds of coincidentally aligned scene features. …”
Get full text

An Application of Line-labeling and other Scene-analysis Techniques to the Problem of Hidden-line Removal by Lavin, Mark A.

Get full text

A Polyhedral Intersection Theorem for Capacitated Spanning Trees by Hall, Leslie A., Magnanti, Thomas L.

“…This result is one of very few known cases in which the intersection of two integer polyhedra yields another integer polyhedron. We also give a complete polyhedral characterization of a related polytope, the 2-capacitated forest polytope.…”
Get full text

Recognition and Localization of Overlapping Parts from Sparse Data by Grimson, W. Eric L., Lozano-Perez, Tomas

“…The objects are modeled as polyhedra (or polygons) having up to six degreed of positional freedom relative to the sensors. …”
Get full text