99 search results - page 4 / 20 » On empty convex polygons in a planar point set |
CCCG
1993
15 years 27 days ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
100
click to vote
CGF
2006
14 years 11 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
DIMACS
2001
15 years 29 days ago
2001
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n2 ) “moves” between simple polygons. Each move is composed of a sequence...
DAM
2006
14 years 11 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...