52 search results - page 6 / 11 » Decomposing a simple polygon into pseudo-triangles and conve... |
WSCG
2004
15 years 1 months ago
2004
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
91
Voted
CORR
1999
Springer
14 years 11 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 ...
CCCG
2010
15 years 1 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, we present an algorithm that utilizes a quadtree data structure to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly cr...
93
Voted
LATIN
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...