Results 1  10
of
40
The Quickhull algorithm for convex hulls
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1996
"... The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the twodimensional Quickhull Algorithm with the generaldimension BeneathBeyond Algorithm. It is similar to the randomized, incremental algo ..."
Abstract

Cited by 452 (0 self)
 Add to MetaCart
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the twodimensional Quickhull Algorithm with the generaldimension BeneathBeyond Algorithm. It is similar to the randomized, incremental algorithms for convex hull and Delaunay triangulation. We provide empirical evidence that the algorithm runs faster when the input contains nonextreme points and that it uses less memory. Computational geometry algorithms have traditionally assumed that input sets are well behaved. When an algorithm is implemented with floatingpoint arithmetic, this assumption can lead to serious errors. We briefly describe a solution to this problem when computing the convex hull in two, three, or four dimensions. The output is a set of “thick ” facets that contain all possible exact convex hulls of the input. A variation is effective in five or more dimensions.
Voronoi Diagrams and Delaunay Triangulations
 Computing in Euclidean Geometry
, 1992
"... The Voronoi diagram is a fundamental structure in computationalgeometry and arises naturally in many different fields. This chapter surveys properties of the Voronoi diagram and its geometric dual, the Delaunay triangulation. The emphasis is on practical algorithms for the construction of Voronoi ..."
Abstract

Cited by 196 (3 self)
 Add to MetaCart
The Voronoi diagram is a fundamental structure in computationalgeometry and arises naturally in many different fields. This chapter surveys properties of the Voronoi diagram and its geometric dual, the Delaunay triangulation. The emphasis is on practical algorithms for the construction of Voronoi diagrams. 1 Introduction Let S be a set of n points in ddimensional euclidean space E d . The points of S are called sites. The Voronoi diagram of S splits E d into regions with one region for each site, so that the points in the region for site s2S are closer to s than to any other site in S. The Delaunay triangulation of S is the unique triangulation of S so that there are no elements of S inside the circumsphere of any triangle. Here `triangulation' is extended from the planar usage to arbitrary dimension: a triangulation decomposes the convex hull of S into simplices using elements of S as vertices. The existence and uniqueness of the Delaunay triangulation are perhaps not obvio...
Adaptive Precision FloatingPoint Arithmetic and Fast Robust Geometric Predicates
 Discrete & Computational Geometry
, 1996
"... Exact computer arithmetic has a variety of uses including, but not limited to, the robust implementation of geometric algorithms. This report has three purposes. The first is to offer fast softwarelevel algorithms for exact addition and multiplication of arbitrary precision floatingpoint values. T ..."
Abstract

Cited by 133 (5 self)
 Add to MetaCart
Exact computer arithmetic has a variety of uses including, but not limited to, the robust implementation of geometric algorithms. This report has three purposes. The first is to offer fast softwarelevel algorithms for exact addition and multiplication of arbitrary precision floatingpoint values. The second is to propose a technique for adaptiveprecision arithmetic that can often speed these algorithms when one wishes to perform multiprecision calculations that do not always require exact arithmetic, but must satisfy some error bound. The third is to provide a practical demonstration of these techniques, in the form of implementations of several common geometric calculations whose required degree of accuracy depends on their inputs. These robust geometric predicates are adaptive; their running time depends on the degree of uncertainty of the result, and is usually small. These algorithms work on computers whose floatingpoint arithmetic uses radix two and exact rounding, including machines complying with the IEEE 754 standard. The inputs to the predicates may be arbitrary single or double precision floatingpoint numbers. C code is publicly available for the 2D and 3D orientation and incircle tests, and robust Delaunay triangulation using these tests. Timings of the implementations demonstrate their effectiveness. Supported in part by the Natural Sciences and Engineering Research Council of Canada under a 1967 Science and Engineering Scholarship and by the National Science Foundation under Grant CMS9318163. The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either express or implied, of NSERC, NSF, or the U.S. Government. Keywords: arbitrary precision floatingpoint arit...
Robust Geometric Computation
, 1997
"... Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section... ..."
Abstract

Cited by 72 (11 self)
 Add to MetaCart
Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section...
A Comparison of Sequential Delaunay Triangulation Algorithms
, 1996
"... This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conquer algorithm, Fortune’s sweepline algorithm, several versions of the incremental algorithm (including one by Ohya, Iri, an ..."
Abstract

Cited by 54 (0 self)
 Add to MetaCart
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conquer algorithm, Fortune’s sweepline algorithm, several versions of the incremental algorithm (including one by Ohya, Iri, and Murota, a new bucketingbased algorithm described in this paper, and Devillers’s version of a Delaunaytree based algorithm that appears in LEDA), an algorithm that incrementally adds a correct Delaunay triangle adjacent to a current triangle in a manner similar to gift wrapping algorithms for convex hulls, and Barber’s convex hull based algorithm. Most of the algorithms examined are designed for good performance on uniformly distributed sites. However, we also test implementations of these algorithms on a number of nonuniform distibutions. The experiments go beyond measuring total running time, which tends to be machinedependent. We also analyze the major highlevel primitives that algorithms use and do an experimental analysis of how often implementations of these algorithms perform each operation.
Safe and Effective Determinant Evaluation
 In Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci
, 1992
"... The problem of evaluating the sign of the determinant of a small matrix arises in many geometric algorithms. Given an n × n matrix A with integer entries, whose columns are all smaller than M in Euclidean norm, the algorithm given here evaluates the sign of the determinant det A exactly. The algorit ..."
Abstract

Cited by 53 (0 self)
 Add to MetaCart
The problem of evaluating the sign of the determinant of a small matrix arises in many geometric algorithms. Given an n × n matrix A with integer entries, whose columns are all smaller than M in Euclidean norm, the algorithm given here evaluates the sign of the determinant det A exactly. The algorithm requires an arithmetic precision of less than 1.5n + 2 lg M bits. The number of arithmetic operations needed is O(n 3) + O(n 2) log OD(A)/β, where OD(A)  det A  is the product of the lengths of the columns of A, and β is the number of “extra ” bits of precision, min{lg(1/u) − 1.1n − 2 lg n − 2, lg N − lg M − 1.5n − 1}, where u is the roundoff error in approximate arithmetic, and N is the largest representable integer. Since OD(A) ≤ M n, the algorithm requires O(n 3 lg M) time, and O(n 3) time when β = Ω(log M). 1
Rounding Arrangements Dynamically
, 1995
"... We describe a robust, dynamic algorithm to compute the arrangement of a set of line segments in the plane, and its implementation. The algorithm is robust because, following Greene 1 and Hobby, 2 it rounds the endpoints and intersections of all line segments to representable points, but in a ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
We describe a robust, dynamic algorithm to compute the arrangement of a set of line segments in the plane, and its implementation. The algorithm is robust because, following Greene 1 and Hobby, 2 it rounds the endpoints and intersections of all line segments to representable points, but in a way that is globally topologically consistent. The algorithm is dynamic because, following Mulmuley, 3 it uses a randomized hierarchy of vertical cell decompositions to make locating points, and inserting and deleting line segments, efficient. Our algorithm is novel because it marries the robustness of the Greene and Hobby algorithms with Mulmuley's dynamic algorithm in a way that preserves the desirable properties of each. Keywords: arrangement, vertical trapezoidal decomposition, dynamic data structure, randomized algorithm, robustness, rounding 1.
Evaluating Signs of Determinants Using SinglePrecision Arithmetic
, 1994
"... We propose a method to evaluate signs of 2 x 2 and 3 x 3 determinants with bbit integer entries using only b and (b + 1)bit arithmetic respectively. This algorithm has numerous applications in geometric computation and provides a general and practical approach to robustness. The algorithm has been ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
We propose a method to evaluate signs of 2 x 2 and 3 x 3 determinants with bbit integer entries using only b and (b + 1)bit arithmetic respectively. This algorithm has numerous applications in geometric computation and provides a general and practical approach to robustness. The algorithm has been implemented and experimental results show that it slows down the computing time by only a small factor with respect to floatingpoint calculation.
Shapes And Implementations In ThreeDimensional Geometry
, 1993
"... Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is often useful or required to compute what one might call the "shape" of the set. For that purpose, this thesis deals with the formal notion of the family of alpha shapes of a finite point set in th ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is often useful or required to compute what one might call the "shape" of the set. For that purpose, this thesis deals with the formal notion of the family of alpha shapes of a finite point set in three dimensional space. Each shape is a welldefined polytope, derived from the Delaunay triangulation of the point set, with a real parameter controlling the desired level of detail. Algorithms and data structures are presented that construct and store the entire family of shapes, with a quadratic time and space complexity, in the worst case.
Robust proximity queries: an illustration of degreedriven algorithm design
 IN: PROC. 13TH ANNU. ACM SYMPOS. COMPUT. GEOM
, 1997
"... In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact computation paradigm and formalize the notion of degree of a geometric algorithm, aa a worstcase quantification of the precision (number of bits) to which arithmetic calculation have to ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact computation paradigm and formalize the notion of degree of a geometric algorithm, aa a worstcase quantification of the precision (number of bits) to which arithmetic calculation have to be executed in order to guarantee topological correctness. We aleo propose a formalism for the expeditious evaluation of algorithmic degree. As an application of this paradigm and an illustration of our general approach, we consider the important classical problem of proximity queries in 2 and 3 dimensions, and develop a new technique for the efficient and robust execution of such queries baaed on an implicit representation of Voronoi diagrams. Our new technique gives both low degree and fast query time, and for 2D queries is optimal with respect to both cost meixmres of the paradigm, asymptotic number of operations md arithmetic degree.