Surface-to-surface intersection problem
Jump to navigation
Jump to search
The surface-to-surface intersection (SSI) problem is a basic workflow 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.[2]
References
[edit | edit source]External links
[edit | edit source]- Surface-to-surface intersections (N.M. Patrikalakis)
Further reading
[edit | edit source]- 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, Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)., Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
 | This design-related article is a stub. You can help Wikipedia by expanding it. |
 | This applied mathematics–related article is a stub. You can help Wikipedia by expanding it. |