115 search results - page 17 / 23 » Refolding planar polygons |
CCCG
1993
13 years 8 months ago
1993
In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...
SIGACT
2008
13 years 7 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
CAGD
2005
13 years 7 months ago
2005
Abstract: Barycentric coordinates can be used both to express a point inside a tetrahedron as a convex combination of the four vertices and to linearly interpolate data given at th...
SMI
2006
IEEE
14 years 1 months ago
2006
IEEE
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...