Jean-Daniel Boissonnat, Monique Teillaud  Home/Search
Context Related
Links: ACM DBLP | inria.fr/INRIA/publicat...RR1140.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The Delaunay Tree is a hierarchical data structure that was introduced in [BT86]. It is defined from the Delaunay triangulation and, roughly speaking, represents a triangulation as a hierarchy of balls. It allows a semi-dynamic construction of the Delaunay triangulation of a finite set of n points in any dimension. In this paper, we prove that a randomized construction of the Delaunay Tree (and thus, of the Delaunay triangulation) can be done in O(n log n) expected time in the plane and in O i... (Update)
Cited by: More
Voronoi Diagrams - Aurenhammer, Klein (Correct)
Regular Triangulations of Dynamic Sets of Points - Marc Vigo Uria (Correct)
Reinforcement Learning in the Joint Space: Value Iteration in.. - Monson (2003) (Correct)
Similar documents (at the sentence level):
13.9%: Towards Dynamic Randomized Algorithms in Computational Geometry - Teillaud (1992) (Correct)
Active bibliography (related documents): More All
0.6: Applications of Random Sampling to On-line.. - Boissonnat.. (1992) (Correct)
0.5: On The Expected Complexity Of The 3-Dimensional Voronoi Diagram - Bernal (1990) (Correct)
0.4: Fully Dynamic Delaunay Triangulation in Logarithmic.. - Devillers, Meiser.. (1992) (Correct)
Similar documents based on text: More All
0.9: A Semi-Dynamic Construction of Higher Order.. - Boissonnat.. (1993) (Correct)
0.7: Robust and efficient implementation of the Delaunay tree - Devillers (1992) (Correct)
0.5: Minkowski Operations For Satellite Antenna Layout - Boissonnat, de Lange, Teillaud (1996) (Correct)
Related documents from co-citation: More All
28: Randomized incremental construction of Delaunay and Voronoi diagrams (context) - Guibas, Knuth et al. - 1992
18: Applications of random sampling in computational geometry - Clarkson, Shor - 1989
16: Applications of random sampling to on-line algorithms in computational geometry - Boissonnat, Devillers et al. - 1992
BibTeX entry: (Update)
J.-D. Boissonnat and M. Teillaud. On the randomized construction of the Delaunay tree. Theoret. Comput. Sci., 112:339--354, 1993. http://citeseer.ist.psu.edu/boissonnat91randomized.html More
@article{ boissonnat93randomized,
author = "Jean-Daniel Boissonnat and Monique Teillaud",
title = "On the randomized construction of the {Delaunay} tree",
journal = "Theoretical Computer Science",
volume = "112",
number = "2",
pages = "339--354",
year = "1993",
url = "citeseer.ist.psu.edu/boissonnat91randomized.html" }
Citations (may not include all citations):1254 Computational Geometry : an Introduction (context) - Preparata, Shamos - 1985
481 Algorithms on Combinatorial Geometry (context) - Edelsbrunner - 1987
335 Applications of random sampling in computational geometry - Clarkson, Shor - 1989
257 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985 ACM DBLP
257 Voronoi diagrams --- a survey of a fundamental geometric dat.. (context) - Aurenhammer - 1991
159 A sweepline algorithm for Voronoi diagrams (context) - Fortune - 1987
101 Randomized incremental construction of Delaunay and Voronoi .. (context) - Guibas, Knuth et al. - 1992
57 Two algorithms for constructing a Delaunay triangulation (context) - Lee, Schachter - 1980
53 Convex hulls of finite sets of points in two and three dimen.. (context) - Preparata, Hong - 1977 ACM
53 Applications of random sampling to on-line algorithms in com.. - Boissonnat, Devillers et al. - 1992 ACM DBLP
39 the construction of abstract Voronoi diagrams (context) - Mehlhorn, Meiser et al. - 1991
38 Higher-dimensional Voronoi diagrams in linear expected time (context) - Dwyer - 1991 ACM DBLP
32 Packing and Covering (context) - Rogers - 1964
29 nearest neighbor Voronoi diagrams in the plane (context) - Lee - 1982
24 A hierarchical representation of objects: The Delaunay Tree (context) - Boissonnat, Teillaud - 1986
22 Computing Dirichlet tesselations in the plane (context) - Green, Sibson - 1978
20 Fully dynamic Delaunay triangulation in logarithmic expected.. - Devillers, Meiser et al. - 1991
16 dimensional Voronoi diagrams (context) - Klee, complexity - 1980
12 Computing Dirichlet tesselations (context) - Bowyer - 1981
11 A semi-dynamic construction of higher order Voronoi diagrams.. - Boissonnat, Devillers et al. - 1990
10 Department of Computer Science (context) - Shamos, PhD - 1978
9 Practical use of bucketing techniques in computational geome.. (context) - Asano, Edahiro et al. - 1985
6 The complexity of Voronoi diagrams in higher dimensions (context) - Seidel - 1982
6 On obstruction in relation to a fixed viewpoint (context) - Mulmuley - 1989
4 A convex hull algorithm optimal for point sites in even dime.. (context) - Seidel - 1981
3 Konvexe Polytope und Dirichletsche Zellenkomplexe (context) - Paschinger - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (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