Advertisement

Distance Separation Measures Between Parametric Curves and Surfaces Toward Intersection and Collision Detection Applications

  • Gershon Elber
Conference paper

Abstract

This paper investigates the use of separation measures for parametric curves and surfaces toward the resolution of interference and intersections between curves and surfaces as well as collision detection. Two types of distance separation measures are discussed.

While the trivial distance function can be derived quite efficiently, it is shown in this work that this trivial distance function is not the optimal approach, in general. A better and more efficient scheme that projects the distance onto the normal field of either manifold is demonstrated to be superior in correctly detecting highly coupled non-intersecting arrangements as such.

Finally, a few extensions that further ease the detection of intersection-free arrangements, for both planar arrangements and arrangements in R3, are also discussed.

Keywords

Distance Function Control Point Convex Hull Collision Detection Interference Test 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. Cohen, T. Lyche, and R. Riesenfeld. Discrete B-splines and Subdivision Techniques in Computer-Aided Geometric Design and Computer Graphics. Computer Graphics and Image Processing, 14, 87–111, October 1980.CrossRefGoogle Scholar
  2. 2.
    S. Gottschalk, M. Lin and D. Manocha. “OBB-Tree: A Hierarchical Structure for Rapid Interference Detection.” Siggraph 96 Conference Proceedings, pp 171–180, Aug. 1996.Google Scholar
  3. 3.
    J. Peters. “Efficient One-Sided Linearization of Spline Geometry.” Mathematics of Surfaces, the 10th IMA International Conference, Michael J. Wilson and Ralph R. Martin (Eds.), pp 297–319, Leeds, UK, September 2003.Google Scholar
  4. 4.
    T. Sederberg and S. R. Parry. “A comparison of three curve intersection algorithms.” Computer Aided Design, Vol 18, No. 1, pp 58–63, 1986.Google Scholar
  5. 5.
    T. W. Sederberg, R. J. Meyers. “Loop Detection in Surface Patch Intersections.” Computer Aided Geometric Design, Vol. 5, No. 2, pp 161–171, 1988.MathSciNetCrossRefGoogle Scholar
  6. 6.
    T. W. Sederberg, S. C. White and A. K. Zundel. “Fat Arcs: A Bounding Region with Cubic Convergence.” Computer Aided Geometric Design, Vol. 6, No. 3, pp 205–218, 1989.CrossRefGoogle Scholar
  7. 7.
    T. W. Sederberg, T. Nishita. “Curve Intersection using Bezier Clipping.” Computer Aided Design, Vol. 22, No. 9, pp 337–345, 1990.CrossRefGoogle Scholar
  8. 8.
    J. Yen, S. Spach, M. Smith and R. Pulleyblank. “Parallel Boxing in B-Spline Intersection.” IEEE Computer Graphics and Applications, pp 72–79, Vol. 11, No. 1, Jan. 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Gershon Elber
    • 1
  1. 1.Technion, Israel Institute of TechnologyHaifaIsrael

Personalised recommendations