Devroye et al., 1998 - Google Patents
A note on point location in Delaunay triangulations of random pointsDevroye et al., 1998
View PDF- Document ID
- 12297781121874390000
- Author
- Devroye L
- Mücke E
- Zhu B
- Publication year
- Publication venue
- Algorithmica
External Links
Snippet
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data structure representing the triangulation. A simple and easy-to-implement (but, of course …
- 238000007781 pre-processing 0 abstract description 4
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30067—File systems; File servers
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Devroye et al. | A note on point location in Delaunay triangulations of random points | |
| US7289814B2 (en) | System and method for detecting proximity between mobile device users | |
| Chen et al. | A free boundary problem for an elliptic-hyperbolic system: an application to tumor growth | |
| Ayer et al. | Exact Hausdorff measure and intervals of maximum density for Cantor sets | |
| Hoel et al. | Efficient processing of spatial queries in line segment databases | |
| Sugihara | Laguerre Voronoi diagram on the sphere | |
| CN112100300A (en) | Method and storage medium for rapid construction of spatial topological relationship of vector land cover patches | |
| Lo et al. | A fast robust algorithm for the intersection of triangulated surfaces | |
| Chavez et al. | Half-space proximal: A new local test for extracting a bounded dilation spanner of a unit disk graph | |
| Karavelas et al. | Static and kinetic geometric spanners with applications. | |
| Günther et al. | The arc tree: an approximation scheme to represent arbitrary curved shapes | |
| Janardan et al. | Widest-corridor problems | |
| Devillers et al. | Queries on Voronoi diagrams of moving points | |
| Erten et al. | Computing Acute and Non-obtuse Triangulations. | |
| Duncan et al. | Planarity-preserving clustering and embedding for large planar graphs | |
| CN105740371A (en) | Density-based incremental clustering data mining method and system | |
| Luo et al. | Construction of near optimal meshes for 3D curved domains with thin sections and singularities for p-version method | |
| Kolountzakis | Distance sets corresponding to convex bodies | |
| Zhu | On Lawson’s oriented walk in random Delaunay triangulations | |
| Asano et al. | A unified scheme for detecting fundamental curves in binary edge images | |
| Bruneel et al. | QuickTrace: a fast algorithm to detect contact | |
| Danovaro et al. | Multiresolution morse triangulations | |
| Schuster | The largest empty circle problem | |
| Devroye et al. | A NOTE ON POINT LOCATION IN RANDOM DELAUNAY TRIANGULATIONS | |
| Krumbholz et al. | Algorithms for Gradual Polyline Simplification |