Results 1  10
of
39
Applications of Random Sampling in Computational Geometry, II
 Discrete Comput. Geom
, 1995
"... We use random sampling for several new geometric algorithms. The algorithms are "Las Vegas," and their expected bounds are with respect to the random behavior of the algorithms. These algorithms follow from new general results giving sharp bounds for the use of random subsets in geometric ..."
Abstract

Cited by 396 (12 self)
 Add to MetaCart
We use random sampling for several new geometric algorithms. The algorithms are "Las Vegas," and their expected bounds are with respect to the random behavior of the algorithms. These algorithms follow from new general results giving sharp bounds for the use of random subsets in geometric algorithms. These bounds show that random subsets can be used optimally for divideandconquer, and also give bounds for a simple, general technique for building geometric structures incrementally. One new algorithm reports all the intersecting pairs of a set of line segments in the plane, and requires O(A + n log n) expected time, where A is the number of intersecting pairs reported. The algorithm requires O(n) space in the worst case. Another algorithm computes the convex hull of n points in E d in O(n log n) expected time for d = 3, and O(n bd=2c ) expected time for d ? 3. The algorithm also gives fast expected times for random input points. Another algorithm computes the diameter of a set of n...
Backwards Analysis of Randomized Geometric Algorithms
 Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics
, 1992
"... The theme of this paper is a rather simple method that has proved very potent in the analysis of the expected performance of various randomized algorithms and data structures in computational geometry. The method can be described as "analyze a randomized algorithm as if it were running backward ..."
Abstract

Cited by 60 (0 self)
 Add to MetaCart
(Show Context)
The theme of this paper is a rather simple method that has proved very potent in the analysis of the expected performance of various randomized algorithms and data structures in computational geometry. The method can be described as "analyze a randomized algorithm as if it were running backwards in time, from output to input." We apply this type of analysis to a variety of algorithms, old and new, and obtain solutions with optimal or near optimal expected performance for a plethora of problems in computational geometry, such as computing Delaunay triangulations of convex polygons, computing convex hulls of point sets in the plane or in higher dimensions, sorting, intersecting line segments, linear programming with a fixed number of variables, and others. 1 Introduction The curious phenomenon that randomness can be used profitably in the solution of computational tasks has attracted a lot of attention from researchers in recent years. The approach has proved useful in such diverse area...
On deletion in Delaunay triangulation
 Internat. J. Comput. Geom. Appl
, 2002
"... This paper presents how the space of spheres and shelling may be used to delete a point from a ddimensional triangulation efficiently. In dimension two, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number only applies to low cost operations, while ..."
Abstract

Cited by 51 (4 self)
 Add to MetaCart
(Show Context)
This paper presents how the space of spheres and shelling may be used to delete a point from a ddimensional triangulation efficiently. In dimension two, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number only applies to low cost operations, while time consuming computations are only done a linear number of times. This algorithm may be viewed as a variation of Heller’s algorithm,[1, 2] which is popular in the geographic information system community. Unfortunately, Heller algorithm is false, as explained in this paper.
Geometric Range Searching
, 1994
"... In geometric range searching, algorithmic problems of the following type are considered: Given an npoint set P in the plane, build a data structure so that, given a query triangle R, the number of points of P lying in R can be determined quickly. Problems of this type are of crucial importance in c ..."
Abstract

Cited by 50 (2 self)
 Add to MetaCart
In geometric range searching, algorithmic problems of the following type are considered: Given an npoint set P in the plane, build a data structure so that, given a query triangle R, the number of points of P lying in R can be determined quickly. Problems of this type are of crucial importance in computational geometry, as they can be used as subroutines in many seemingly unrelated algorithms. We present a survey of results and main techniques in this area.
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
 In Proc. 14th Annu. ACM Sympos. Comput. Geom
, 1998
"... The straight skeleton of a polygon is a variant of the medial axis, introduced by Aichholzer et al., defined by a shrinking process in which each edge of the polygon moves inward at a fixed rate. We construct the straight skeleton of an ngon with r reflex vertices in time O(n 1+" +n 8=11+& ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
(Show Context)
The straight skeleton of a polygon is a variant of the medial axis, introduced by Aichholzer et al., defined by a shrinking process in which each edge of the polygon moves inward at a fixed rate. We construct the straight skeleton of an ngon with r reflex vertices in time O(n 1+" +n 8=11+" r 9=11+" ), for any fixed " ? 0, improving the previous best upper bound of O(nr log n). Our algorithm simulates the sequence of collisions between edges and vertices during the shrinking process, using a technique of Eppstein for maintaining extrema of binary functions to reduce the problem of finding successive interactions to two dynamic range query problems: (1) maintain a changing set of triangles in IR 3 and answer queries asking which triangle would be first hit by a query ray, and (2) maintain a changing set of rays in IR 3 and answer queries asking for the lowest intersection of any ray with a query triangle. We also exploit a novel characterization of the straight skeleton as a ...
Improved Incremental Randomized Delaunay Triangulation
, 1997
"... We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location ..."
Abstract

Cited by 44 (9 self)
 Add to MetaCart
(Show Context)
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location
The Delaunay hierarchy
 Internat. J. Found. Comput. Sci
"... We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small memory occupation and the possibility of fully dynamic insertions and deletions. The location structure is organized into s ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
(Show Context)
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small memory occupation and the possibility of fully dynamic insertions and deletions. The location structure is organized into several levels. The lowest level just consists of the triangulation, then each level contains the triangulation of a small sample of the level below. Point location is done by walking in a triangulation to determine the nearest neighbor of the query at that level, then the walk restarts from that neighbor at the level below. Using a small subset (3%) to sample a level allows a small memory occupation; the walk and the use of the nearest neighbor to change levels quickly locate the query.
On lazy randomized incremental construction
 In Proc. 26th Annu. ACM Sympos. Theory Comput
, 1994
"... We introduce a new type of randomized incremental algorithms. Contrary to standard randomized incremental algorithms, these lazy randomized incremental algorithms are suited for computing structures that have a `nonlocal' definition. In order to analyze these algorithms we generalize some resu ..."
Abstract

Cited by 34 (8 self)
 Add to MetaCart
(Show Context)
We introduce a new type of randomized incremental algorithms. Contrary to standard randomized incremental algorithms, these lazy randomized incremental algorithms are suited for computing structures that have a `nonlocal' definition. In order to analyze these algorithms we generalize some results on random sampling to such situations. We apply our techniques to obtain efficient algorithms for the computation of single cells in arrangements of segments in the plane, single cells in arrangements of triangles in space, and zones in arrangements of hyperplanes. We also prove combinatorial bounds on the complexity of what we call the (6k)cell in arrangements of segments in the plane or triangles in space; this is the set of all points on the segments (triangles) that can reach the origin with a path that crosses at most k, 1 segments (triangles).
Approximating Generalized Voronoi Diagrams in Any Dimension
, 1995
"... Generalized Voronoi diagrams of objects are difficult to compute in a robust way, especially in higher dimensions. For a number of applications an approximation of the real diagram within some predetermined precision is sufficient. In this paper we study the computation of such approximate Voronoi d ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
Generalized Voronoi diagrams of objects are difficult to compute in a robust way, especially in higher dimensions. For a number of applications an approximation of the real diagram within some predetermined precision is sufficient. In this paper we study the computation of such approximate Voronoi diagrams. The emphasis is on practical applicability, therefore we are mainly concerned with fast (in terms of running time) computation, generality, robustness, and easy implementation, rather than optimal combinatorial and computational complexity. Given a set of disjoint convex sites in any dimension we describe a general algorithm that approximates their Voronoi diagram with arbitrary precision; the only primitive operation that is required is the computation of the distance from a point to a site. The method is illustrated by its application to motion planning using retraction. To justify our claims on practical applicability, we provide experimental results obtained with implementations...