42 search results - page 5 / 9 » Random triangulations of planar point sets |
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
SODA
1997
ACM
13 years 9 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
ENDM
2011
12 years 7 months ago
2011
We study a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B construct a triangulation on a given planar point set V . Starting from no...