Franz Aurenhammer, Rolf Klein  Home/Search
Context Related
| wwwpi6.fernunihagen.de/Pub...tr198.pdf 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: web.informatik.uni...techreports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Voronoi diagrams can also be thought of as lower envelopes, in the sense mentioned at the beginning of this subsection. Namely, for each point x not situated on a bisecting curve, the relation p x q defines a total ordering on S. If we construct a set of surfaces H p , p S,in3-space such that H p is below H q i# p x q holds, then the projection of their lower envelope equals the abstract Voronoi diagram. (Update)
Cited by: More
Computing the Detour of Polygonal Curves - Agarwal, Klein, Knauer, Sharir (2002) (Correct)
The weighted farthest color Voronoi diagram on.. - Hurtado.. (2002) (Correct)
Nearest Neighbour Search in Hausdorff Distance Pattern Spaces - Braß, Knauer (2001) (Correct)
Active bibliography (related documents): More All
0.6: Computational Geometry - Lee (1996) (Correct)
0.6: Straight Skeletons for General Polygonal Figures in the Plane - Aichholzer, Aurenhammer (1996) (Correct)
0.5: Geometric Data Structures for Computer Graphics - Zachmann, Langetepe (2003) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
Related documents from co-citation: More All
13: Voronoi diagrams --- a survey of a fundamental geometric data structure (context) - Aurenhammer - 1991
10: Davenport-Schinzel Sequences and Their Geometric Applications - Agarwal, Sharir - 1995
9: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams (context) - Okabe, Boots et al. - 1992
BibTeX entry: (Update)
F. Aurenhammer and R. Klein, Voronoi Diagrams, in: J.R. Sack and G. Urrutia (eds.), Handbook on Computational Geometry, Elsevier, to appear. http://citeseer.ist.psu.edu/760048.html More
@misc{ aurenhammer-voronoi,
author = "F. Aurenhammer and R. Klein",
title = "Voronoi Diagrams",
text = "F. Aurenhammer and R. Klein, Voronoi Diagrams, in: J.R. Sack and G. Urrutia
(eds.), Handbook on Computational Geometry, Elsevier, to appear.",
url = "citeseer.ist.psu.edu/760048.html" }
Citations (may not include all citations):257 Voronoi diagrams: A survey of a fundamental geometric data s.. (context) - Aurenhammer - 1991
169 Algorithms for reporting and counting geometric intersection.. (context) - Bentley, Ottmann - 1979
117 Mesh generation and optimal triangulation - Bern, Eppstein - 1992
109 Provably good mesh generation - Bern, Eppstein et al. - 1994
86 Constrained Delaunay triangulations (context) - Chew - 1989
81 A linear-time algorithm for computing the Voronoi diagram of.. (context) - Aggarwal, Guibas et al. - 1989
77 Worst-case analysis of a new heuristic for the traveling sal.. (context) - Christofides - 1976
69 Optimal expected-time algorithms for closest-point problems (context) - Bentley, Weide et al. - 1980
57 Guaranteed-quality mesh generation for curved surfaces (context) - Chew - 1993
53 Applications of random sampling to on-line algorithms in com.. - Boissonnat, Devillers et al. - 1992
52 Real algebraic and semi-algebraic sets (context) - Benedetti, Risler - 1990
51 Voronoi diagrams based on convex distance functions (context) - Chew, Drysdale - 1985
47 Voronoi diagrams from convex hulls (context) - Brown - 1979
45 New sparseness results on graph spanners - Chandra, Das et al. - 1995
43 An optimal convex hull algorithm in any fixed dimension (context) - Chazelle - 1993
41 How to compute the Voronoi diagram of line segments: Theoret.. (context) - Burnikel, Mehlhorn et al. - 1994
41 Representing geometric structures in d dimensions: Topology .. (context) - Brisson - 1989
41 the randomized construction of the Delaunay tree - Boissonnat, Teillaud - 1993
38 Euclidean minimum spanning trees and bichromatic closest pai.. (context) - Agarwal, Edelsbrunner et al. - 1991
35 Some dynamic computational geometry problems (context) - Atallah - 1985
31 Finding the medial axis of a simple polygon in linear time - Chin, Snoeyink et al. - 1995
31 Three dimensional reconstruction of complex shapes based on .. (context) - Boissonnat, Geiger - 1905
31 Output-sensitive construction of polytopes in four dimension.. (context) - Chan, Snoeyink et al. - 1995
29 Constructing levels in arrangements and higher order Voronoi.. - Agarwal, de Berg et al. - 1994
29 algorithms and applications (context) - Aurenhammer, properties - 1987
27 Building Voronoi diagrams for convex polygons in linear expe.. (context) - Chew - 1986
27 points with minimum diameter and related problems (context) - Aggarwal, Imai et al. - 1991
25 The Geometry of Geodesics (context) - Busemann - 1955
24 There are planar graphs almost as good as the complete graph (context) - Chew - 1989
23 An optimal algorithm for constructing the weighted Voronoi d.. (context) - Aurenhammer, Edelsbrunner - 1984
22 Clustering algorithms based on minimum and maximum spanning .. (context) - Asano, Bhattacharya et al. - 1988
21 Solving query-retrieval problems by compacting Voronoi diagr.. (context) - Aggarwal, Hansen et al. - 1990
20 Simplified Voronoi diagrams - Canny, Donald - 1988
19 Voronoi diagrams in higher dimensions under certain polyhedr.. - Boissonnat, Sharir et al. - 1995
17 Triangulations intersect nicely - Aichholzer, Aurenhammer et al. - 1996
17 A novel type of skeleton for polygons - Aichholzer, Alberts et al. - 1995
17 Geometric transforms for fast geometric algorithms (context) - Brown - 1980
16 Geometric clusterings - Capoyleas, Rote et al. - 1991
16 On clustering problems with connected optima in Euclidean sp.. (context) - Boros, Hammer - 1988
16 The Voronoi diagram of curved objects (context) - Alt, Schwarzkopf - 1995
14 Divide-and-conquer in multidimensional space (context) - Bentley, Shamos - 1976
13 An improved algorithm for constructing kth- order Voronoi di.. (context) - Chazelle, Edelsbrunner - 1987
11 Improved algorithms for discs and balls using power diagrams (context) - Aurenhammer - 1988
11 On computing Voronoi diagrams by divideprune -and-conquer - Amato, Ramos - 1996
10 the geodesic Voronoi diagram of point sites in a simple poly.. (context) - Aronov - 1989
10 On geometric algorithms that use the furthest-point Voronoi .. (context) - Bhattacharya, Toussaint - 1985
9 A simple on-line randomized incremental algorithm for comput.. (context) - Aurenhammer, Schwarzkopf - 1992
8 Algorithmic aspect of motion planning: a tutorial (context) - Alt, Yap - 1990
8 Algorithmic aspect of motion planning: a tutorial (context) - Alt, Yap - 1990
7 Developing a practical projectionbased parallel Delaunay alg.. - Blelloch, Miller et al. - 1996
7 Voronoi diagrams of lines in 3-space under polyhedral convex.. - Chew, Kedem et al. - 1995
5 Minkowski-type theorems and least-squares partitioning (context) - Aurenhammer, Ho et al. - 1992
5 Expected case analysis of #-skeletons with applications to t.. (context) - Cheng, Golin et al. - 1995
5 Information and System Sciences (context) - Akl, on et al. - 1983
4 Geometric relations among Voronoi diagrams (context) - Aurenhammer, Imai - 1988
4 Output-sensitive construction of the 3-d Delaunay triangulat.. (context) - Boissonnat, Cerezo et al. - 1991
4 skeleton within a minimum weight triangulation (context) - Cheng, Xu et al. - 1996
3 Dot pattern processing using Voronoi polygons as neighborhoo.. (context) - Ahuja - 1982
3 A Voronoi method for the piano-movers problem (context) - Canny - 1985
2 Recognizing Dirichlet tesselations (context) - Ash, Bolker - 1985
2 Linear combinations from power domains (context) - Aurenhammer - 1988
2 A new duality result concerning Voronoi diagrams (context) - Aurenhammer - 1990
2 National Institute of Standards and Technology (context) - Bernal, on et al. - 2089
2 Straight skeletons for general polygonal figures (context) - Aichholzer, Aurenhammer - 1995
2 Recognising polytopical cell complexes and constructing proj.. (context) - Aurenhammer - 1987
1 and spider webs (context) - Ash, Bolker et al. - 1988
1 A lower bound on Voronoi diagram complexity (context) - Aronov - 1998
1 A merge-first divide & conquer algorithm for E (context) - Cignoni, Montani et al.
1 Voronoi diagrams and containment of families of convex sets .. (context) - Abellanas, Hernandez et al. - 1995
1 Computing the volume of the union of spheres (context) - Avis, Bhattacharya et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://web.informatik.uni-bonn.de/I/publications/techreports.html): More
A Linear-Time Randomized Algorithm for the Bounded Voronoi.. - Klein, al. (1993) (Correct)
Exploring Grid Polygons Online - Icking, Kamphans, Klein, Langetepe (2005) (Correct)
On the Pagination of Complex Documents - Brüggemann-Klein, Klein, Wohlfeil (1998) (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