99 search results - page 10 / 20 » On empty convex polygons in a planar point set |
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
IJRR
2008
14 years 11 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
105
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...
92
Voted
STOC
1993
ACM
15 years 3 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
125
Voted
SMI
2006
IEEE
15 years 5 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 ...