 Aspects of Algorithms for Manifold IntersectionTor Dokken ()
Chapter 18 in Numerical Methods and Software Tools in Industrial Mathematics, 1997, pp 365-380 from Springer Abstract: Abstract The implementation of intersection algorithms is in most cases tailored to the use of specific methods for geometry representation and to the specific needs in a given application. As the computers grow more and more powerful, the ability to solve complex intersection problems are improved. Thus better understanding of intersection algorithms independent of the dimension of the objects being intersected and the dimension of the space in which the objects lie, will simplify the development of new intersection algorithms. To contribute to this we will in this chapter address some topics that are central when new intersection algorithms are to be developed. The first of these is a generic structure for intersection algorithms, then the handling of intersection tolerances is addressed followed by strategies for identifying intersections. The final topic addressed is conditions that ensure that no internal loops exist in the intersection of smooth manifolds. Keywords: Tangent Bundle; Smooth Manifold; Disjoint Subset; Intersection Problem; NURBS Curve (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-1984-2_18 Ordering information: This item can be ordered from DOI: 10.1007/978-1-4612-1984-2_18 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.