fbpx
Wikipedia

Surface-to-surface intersection problem

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

  1. ^ Barnhill, R.; Farin, G.; Jordan, M.; Piper, B. (1987). "Surface/Surface Intersection". Computer Aided Geometric Design. 4 (3): 16. doi:10.1016/0167-8396(87)90020-3.
  2. ^ M. Hohmeyer. Robust and Efficient Surface Intersection for Solid Modeling. Report No. UCB/CSD 92/681 May 1992, Computer Science Division (EECS), University of California, Berkeley, California

External links edit

  • Surface-to-surface intersections (N.M. Patrikalakis)

Further reading edit

  • 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 0-444-51104-0, ISBN 978-0-444-51104-1


surface, surface, intersection, problem, surface, surface, intersection, problem, basic, workflow, computer, aided, geometric, design, given, intersecting, surfaces, compute, parts, intersection, curve, surfaces, intersect, result, will, isolated, points, curv. 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 Barnhill R Farin G Jordan M Piper B 1987 Surface Surface Intersection Computer Aided Geometric Design 4 3 16 doi 10 1016 0167 8396 87 90020 3 M Hohmeyer Robust and Efficient Surface Intersection for Solid Modeling Report No UCB CSD 92 681 May 1992 Computer Science Division EECS University of California Berkeley CaliforniaExternal links editSurface to surface intersections N M Patrikalakis Further reading editErnst 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 0 444 51104 0 ISBN 978 0 444 51104 1 nbsp This design related article is a stub You can help Wikipedia by expanding it vte nbsp This applied mathematics related article is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Surface to surface intersection problem amp oldid 1189178204, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.