42 search results - page 6 / 9 » Random triangulations of planar point sets |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
ENDM
2008
13 years 7 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
CORR
2007
Springer
13 years 7 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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...