Sciweavers

Share
SMA
2006
ACM

A higher dimensional formulation for robust and interactive distance queries

10 years 27 days ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This higher dimensional formulation solves for all query points in the domain simultaneously, therefore providing opportunities to speed computation by applying coherency techniques. In this framework, minimum distance between a point and planar curve is solved using a single polynomial equation in three variables (two variables for a position of the point and one for the curve). This formulation yields twomanifold surfaces as a zero-set in a 3D parameter space. Given a particular query point, the solution space’s remaining degrees-offreedom are fixed and we can numerically compute the minimum distance in a very efficient way. We further recast the problem of analyzing the topological structure of the solution space to that of solving two polynomial equations in three variables. This topological information p...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where SMA
Authors Joon-Kyung Seong, David E. Johnson, Elaine Cohen
Comments (0)
books