““Meshsweeper:” Fast Closest Point on a Polygonal Mesh” by Guéziec
Conference:
Title:
- “Meshsweeper:” Fast Closest Point on a Polygonal Mesh
Session/Category Title: Geometry
Presenter(s)/Author(s):
Interest Area:
- Application
Abstract:
A new algorithm for computing the distance from a point to an arbitrary polygonal mesh. The algorithm is dynamic. It uses a priority process to exploit coherence between subsequent queries.
Submit a story:
If you would like to submit a story about this presentation, please contact us: historyarchives@siggraph.org
