CCCG
2006
13 years 6 months ago
2006
We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into ex...
CCCG
2010
13 years 6 months ago
2010
We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interiordisjoint simple p...
CCCG
2010
13 years 6 months ago
2010
We introduce k-star-shaped polygons, polygons for which there exists at least one point x such that for any point y of the polygon, segment xy crosses the polygon's boundary ...
JCDCG
2000
Springer
13 years 8 months ago
2000
Springer
A k-dissection D of a polygon P, is a partition of P into a set of subpolygons {Q1, . . . , Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, ....
ESA
2000
Springer
13 years 8 months ago
2000
Springer
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
COMPGEOM
1997
ACM
13 years 9 months ago
1997
ACM
An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P1, P2, P3, . . . , Pk in a container polygon Q, translate an...
COMPGEOM
1997
ACM
13 years 9 months ago
1997
ACM
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...
SIGGRAPH
2010
ACM
13 years 9 months ago
2010
ACM
We propose a technique that takes a triangulated surface as input and outputs a surface with the same topology but altered geometry such that each polygon falls into a set of disc...
VRST
2003
ACM
13 years 10 months ago
2003
ACM
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...