115 search results - page 12 / 23 » Refolding planar polygons |
SAC
2010
ACM
14 years 2 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
CCCG
2010
13 years 8 months ago
2010
We explore which polyhedra and polyhedral complexes can be formed by folding up a planar polygonal region and fastening it with one zipper. We call the reverse process a zipper un...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the ...
ICPP
1993
IEEE
13 years 11 months ago
1993
IEEE
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les ....
ALGORITHMICA
2000
13 years 7 months ago
2000
This paper explores a method of manipulating a planar rigid part on a conveyor belt using a robot with just one joint. This approach has the potential of offering a simple and fle...