Approximating nearest neighbor among triangles in convex position
From MaRDI portal
Publication:975498
DOI10.1016/j.ipl.2008.07.010zbMath1191.68876OpenAlexW1984392269MaRDI QIDQ975498
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.010
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point location in arrangements of hyperplanes
- Extreme elevation on a 2-manifold
- Making data structures persistent
- Polyhedral Voronoi diagrams of polyhedra in three dimensions
- Segmenting molecular surfaces
- Ray Shooting and Parametric Search
- Space-efficient approximate Voronoi diagrams
- A linear algorithm for determining the separation of convex polyhedra
- A Randomized Algorithm for Closest-Point Queries
- Applications of a Planar Separator Theorem
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Parallel Transitive Closure and Point Location in Planar Structures