Efficient Point Projection to Freeform Curves and Surfaces
We present an efficient algorithm for projecting a given point to its closest point on a family of freeform C 1-continuous curves and surfaces. The algorithm is based on an efficient culling technique that eliminates redundant curves and surfaces which obviously contain no projection from the given point. Based on this scheme, we can reduce the whole computation to considerably smaller subproblems, which are then solved using a numerical method. In several experimental results, we demonstrate the effectiveness of the proposed approach.
KeywordsDistance Function Query Point Voronoi Cell Curve Segment Point Projection
Unable to display preview. Download preview PDF.
- 1.Lin, M.C., Gottschalk, S.: Collision detection between geometric models: A survey. In: Proc. of IMA Conference on Mathematics of Surfaces, pp. 37–56 (1998)Google Scholar
- 2.Lin, M.C., Manocha, D.: Collision and proximity queries. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 787–807. Chapman & Hall/CRC (2004)Google Scholar
- 4.Lin, M.C., Canny, J.: A fast algorithm for incremental distance calculation. In: IEEE Int. Conf. Robot. Automat., Sacramento, CA, April 1991, pp. 1008–1014 (1991)Google Scholar
- 5.Johnson, D.: Minimum distance queries for haptic rendering. PhD thesis, Computer Science Department, University of Utah (2005)Google Scholar
- 12.Elber, G., Kim, M.-S.: Geometric constraint solver using multivariate rational spline functions. In: Proc. of the Sixth ACM Symposium on Solid Modeling and Applications, pp. 1–10 (2001)Google Scholar
- 17.IRIT 9.5 User’s Manual, Technion, http://www.cs.technion.ac.il/~irit