Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Efficient Distance Computation for Quadratic Curves and Surfaces


Lennerz,  Christian
Discrete Optimization, MPI for Informatics, Max Planck Society;


Schömer,  Elmar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Lennerz, C., & Schömer, E. (2002). Efficient Distance Computation for Quadratic Curves and Surfaces. In Proceedings of the 2nd Conference on Geometric Modeling and Processing (pp. 60-69). Los Alamitos, CA: IEEE.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2F63-7
Virtual prototyping and assembly planning require physically based simulation techniques. In this setting the relevant objects are mostly mechanical parts, designed in CAD-programs. When exported to the prototyping and planning systems, curved parts are approximated by large polygonal models, thus confronting the simulation algorithms with high complexity. Algorithms for collision detection in particular are a bottleneck of efficiency and suffer from accuracy and robustness problems. To overcome these problems, our algorithm directly operates on the original CAD-data. This approach reduces the input complexity and avoids accuracy problems due to approximation errors. We present an efficient algorithm for computing the distance between patches of quadratic surfaces trimmed by quadratic curves. The distance calculation problem is reduced to the problem of solving univariate polynomials of a degree of at most 24. Moreover, we will identify an important subclass for which the degree of the polynomials is bounded by 8.