115 search results - page 18 / 23 » Refolding planar polygons |
TVCG
2010
13 years 5 months ago
2010
—This paper presents the first practical method for “origamizing” or obtaining the folding pattern that folds a single sheet of material into a given polyhedral surface with...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
CCCG
2003
13 years 8 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
WADS
2005
Springer
14 years 25 days ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
SIROCCO
2001
13 years 8 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...