Approximating nearest neighbor among triangles in convex position

DOI10.1016/J.IPL.2008.07.010zbMATH Open1191.68876OpenAlexW1984392269MaRDI QIDQ975498FDOQ975498

Yusu Wang

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

zbMATH Keywords

computational geometryapproximation algorithmsdesign of algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Applications of a Planar Separator Theorem
• Title not available (Why is that?)
• A linear algorithm for determining the separation of convex polyhedra
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Making data structures persistent
• Title not available (Why is that?)
• Extreme elevation on a 2-manifold
• Point location in arrangements of hyperplanes
• A Randomized Algorithm for Closest-Point Queries
• Ray Shooting and Parametric Search
• Polyhedral Voronoi diagrams of polyhedra in three dimensions
• Title not available (Why is that?)
• Segmenting molecular surfaces
• Space-efficient approximate Voronoi diagrams
• Parallel Transitive Closure and Point Location in Planar Structures

This page was built for publication: Approximating nearest neighbor among triangles in convex position

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975498)