137 search results - page 3 / 28 » On polygons excluding point sets |
73
Voted
CORR
2007
Springer
14 years 9 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...
SIAMDM
2010
14 years 8 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
114
click to vote
CCCG
2006
14 years 11 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
PSIVT
2007
Springer
15 years 3 months ago
2007
Springer
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
97
Voted
GC
2007
Springer
14 years 9 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...