Documents
Authors
Tables
Log in
Sign up
MetaCart
DMCA
Donate
Documents:
Advanced Search
Include Citations
Authors:
Advanced Search
Include Citations |
Disambiguate
Tables:
DMCA
Self-Adapting Point Location (2010)
Cached
Download Links
[hal.inria.fr]
[hal.inria.fr]
Save to List
Add to Collection
Correct Errors
Monitor Changes
by Pedro Machado Manhães de Castro , Olivier Devillers
Summary
Citations
Active Bibliography
Co-citation
Clustered Documents
Version History
Citations
369
Poisson surface reconstruction”,
- Kazhdan, Bolitho, et al. - 2006
355
Integral geometry and geometric probability.
- Santaló - 1976
273
Optimal search in planar subdivisions.
- Kirkpatrick - 1981
222
Computing Dirichlet tessellations,’
- Bowyer - 1981
216
The shortest path through many points
- Beardwood, Halton, et al. - 1959
214
The Algorithm Design Manual.
- Skiena - 1998
143
Computing Dirichlet tesselations in the plane.
- Green, Sibson - 1978
132
Optimum binary search trees.
- Knuth - 1971
104
The Exact Computation Paradigm
- Yap - 1995
94
Growth rates of Euclidean minimal spanning trees with power weighted edges.
- Steele - 1988
94
and J.O’Rourke, Handbook of discrete and computational geometry
- Goodman - 2004
63
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations.
- Mucke, Saias, et al. - 1999
46
Spacefilling curves and the planar travelling salesman problem
- Platzman, Bartholdi - 1989
45
Classroom examples of robustness problems in geometric computations
- Kettner, Mehlhorn, et al. - 2004
43
The Delaunay hierarchy.
- Devillers - 2002
38
Asymptotics for Euclidean minimal spanning trees on random points. Probab. Theory Related Fields 92
- ALDOUS, M - 1992
32
A note on point location in Delaunay triangulations of random points
- Devroye, Mücke, et al. - 1998
28
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
- Connor, Kumar
25
New upper bounds for pairing heaps,
- Iacono - 2000
23
A simple entropy-based algorithm for planar point location
- Arya, Malamatos, et al. - 2001
21
On the average complexity of 3d-Voronoi diagrams of random points on convex polytopes.
- Golin, H-S - 2003
20
Complexity of delaunay triangulation for points on lower-dimensional polyhedra.
- Amenta, Attali, et al. - 2007
18
Box integrals,”
- Bailey, Borwein, et al. - 2007
17
Expected time analysis for Delaunay point location
- Devroye, Lemaire, et al. - 2004
16
Monique Teillaud. Walking in a triangulation
- Devillers, Pion
14
Expected asymptotically optimal planar point location
- Iacono
13
Proximate planar point location
- Iacono, Langerman - 2003
13
2d Triangulations."
- Yvinec - 2013
10
Spatial sorting.
- Delage - 2007
10
and Monique Teillaud. 3D triangulations
- Pion
9
Proximate point searching
- Demaine, Iacono, et al. - 2002
9
Stabbing Delaunay tetrahedralizations.
- Shewchuk - 2004
9
Worst-case growth rates of some classical problems of combinatorial optimization
- Steele, Snyder - 1989
7
The Open Problems Project, http://www.cs.smith.edu/˜orourke/TOPP
- Demaine, Mitchell, et al.
6
On the stabbing number of a random Delaunay triangulation
- Bose, Devroye
5
for efficient data types and algorithms. http://www.algorithmic-solutions. com/enleda.htm
- Leda
5
Convex hulls of samples from spherically symmetric distributions
- Dwyer - 1989
4
Cost of sequential connection for points in
- Steele - 1989
3
Lower bounds for expected-case planar point location
- Malamatos
3
N.: Point set processing
- ALLIEZ, SABORET, et al.
3
Cost of sequential connection for points in space
- Steele - 1989
2
André Lieutier. Complexity of the Delaunay triangulation of points on surfaces: the smooth case
- Attali, Boissonnat - 2003
2
General spacefilling curve heuristics and limit theory for the traveling salesman problem
- Gao, Steele - 1994
2
D.: An experimental study of point location in planar arrangements in CGAL
- Haran, Halperin - 2008
2
Concerning R 1 0
- Anderssen, Brent, et al. - 1976
1
J.-Daniel Boissonnat. A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
- Attali
1
Practical nearest neighbor search in the plane
- Connor, Kumar
1
de Castro and O Devillers. On the size of some trees embedded
- M - 2010
1
Manhaes de Castro and Olivier Devillers. Demo: Point Location Strategies
- Machado - 2010