Sciweavers

346 search results - page 18 / 70
» Isodiametric Problems for Polygons
Sort
View
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
14 years 4 months ago
Road Network Reconstruction for Organizing Paths
We consider the problem of reconstructing a road network from a collection of path traces and provide guarantees on the accuracy of the reconstruction under reasonable assumptions...
Daniel Chen, Leonidas J. Guibas, John Hershberger,...
SAC
2010
ACM
14 years 2 months ago
Reachability analysis of GSPDIs: theory, optimization, and implementation
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...
Hallstein Asheim Hansen, Gerardo Schneider
IJCM
2002
68views more  IJCM 2002»
13 years 7 months ago
Computing an Optimal Hatching Direction in Layered Manufacturing
In Layered Manufacturing (LM), a prototype of a virtual polyhedral object is built by slicing the object into polygonal layers, and then building the layers one after another. In ...
Jörg Schwerdt, Michiel H. M. Smid, Man Chung ...
CCCG
2006
13 years 8 months ago
Polygons Flip Finitely: Flaws and a Fix
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, ...
COMPGEOM
1999
ACM
13 years 11 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...