Jump to content

Surface-to-surface intersection problem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kdhape (talk | contribs) at 07:37, 19 December 2008 (Created page with 'The '''surface-to-surface intersection (SSI) problem'''. is a basic problem in computer-aided geometric design: Given two intersecting surfaces in R<sup>3</sup>...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The surface-to-surface intersection (SSI) problem. is a basic problem in computer-aided geometric design: Given two intersecting surfaces in R3, compute all parts of the intersection curve. If two surfaces intersect, the result will be a set of isolated points, a set of curves, a set of overlapping surfaces, or any combination of these cases[1]. Because exact solutions can be found only for some special surface classes, approximation methods must be used for the general case.

References

  1. ^ R. Barnhill, G. Farin, M. Jordan, and B. Piper. Surface/Surface Intersection. Computer Aided Geometric Design, 4:3-16,1987.

Further reading

  • Ernst Huber, Intersecting General Parametric Surfaces Using Bounding Volumes, Tenth Canadian Conference on Computational Geometry - CCCG'98,1998.
  • Ernst Huber, Surface-to-surface intersection based on triangular parameter domain subdivision, Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15-18, 1999
  • Handbook of Computer Aided Geometric Design, By Gerald E. Farin, Josef Hoschek, Myung-Soo Kim, Published by Elsevier, 2002, ISBN 0444511040, 9780444511041