(Enter summary)
Abstract: This paper describes extensions to a previous algorithm that robustly builds three-dimensional
Voronoi diagrams in the presence of inexact numerical computations. The extensions improve
the algorithm's accuracy, making its results more nearly represent the proximity properties of
an ideal Voronoi diagram. In empirical tests, these extensions have improved accuracy by more
than eight orders of magnitude. Complete pseudocode for the algorithm appears in an appendix
of this paper.
1 Introduction... (Update)
Similar documents (at the sentence level):
9.3%: Collision Detection for Interactive Graphics Applications - Hubbard (1995)
(Correct)
Active bibliography (related documents): More All
0.3: Automatic Creation of Boundary-Representation Models from Single.. - Varley (2002)
(Correct)
0.2: Approximating Polyhedra with Spheres for Time-Critical Collision.. - Hubbard (1996)
(Correct)
0.2: Robust Proximity Queries in Implicit Voronoi Diagrams - Liotta, Preparata, Tamassia (1996)
(Correct)
Similar documents based on text: More All
0.3: An Interpolant Based on Line Segment Voronoi Diagrams - Hiyoshi, Sugihara (1999)
(Correct)
0.0: Grids, Connectivity And Contour Tracing - Toussaint
(Correct)
0.0: Nonparametric Density Estimation using Random Linear Tessellations - Hearne
(Correct)
BibTeX entry: (Update)
@article{ hubbard96improving,
author = "Philip M. Hubbard",
title = "Improving Accuracy in a Robust Algorithm for Three-{D}imensional Voronoi Diagrams",
journal = "Journal of Graphics Tools",
volume = "1",
number = "1",
pages = "33--45",
year = "1996",
url = "citeseer.ist.psu.edu/hubbard96improving.html" }
Citations (may not include all citations):
1254
Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
140
Simulation of simplicity: A technique to cope with degenerat..
- Edelsbrunner, Mucke - 1990
109
the shortest spanning subtree of a graph and the traveling s.. (context) - Kruskal, On - 1956
81
Collision Detection for Interactive Graphics Applications
- Hubbard - 1994
66
Approximating polyhedra with spheres for time-critical colli..
- Hubbard - 1996
57
Computing Dirichlet tessellations (context) - Bowyer - 1981
46
Efficient Delaunay triangulation using rational arithmetic (context) - Karasick, Lieber et al. - 1991
39
The problems of accuracy and robustness in geometric computa.. (context) - Hoffmann - 1989
12
Constructing discrete medial axis of 3-D objects (context) - Goldak, Yu et al. - 1991
12
one million (context) - Sugihara, Iri et al. - 1992
10
Delaunay triangulations in three dimensions with finite prec.. (context) - Dey, Sugihara et al. - 1992
8
Degeneracy in geometric computation and the perturbation app.. (context) - Schorn - 1994
7
Numerically robust incremental algorithm for constructing th.. (context) - Inagaki, Sugihara et al. - 1992
3
Intersection of three planes (context) - Goldman - 1990
1
Delaunay triangulation in three dimensions (context) - Fang, Piegl - 1995
1
Direct volume rendering of irregularly sampled data using Vo.. (context) - Joseph - 1996
Documents on the same site (http://ls7-www.informatik.uni-dortmund.de/html/diplomarbeiten/tinnefeld-04-98/literatur): More
Nearest Neighbour Search for Visualization Using Arbitrary.. - Frank Weller
(Correct)
Voronoi Diagrams of Moving Points - Albers, Mitchell, Guibas, Roos
(Correct)
Stability of Voronoi Neighborship under Perturbations of the Sites .. - Ll Er
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC