Intersection Algorithms and CAGD

Tor Dokken () and Vibeke Skytt ()
Additional contact information
Tor Dokken: SINTEF ICT, Applied Mathematics
Vibeke Skytt: SINTEF ICT, Applied Mathematics

A chapter in Geometric Modelling, Numerical Simulation, and Optimization, 2007, pp 41-90 from Springer

Abstract: Abstract An approach for calculating intersections between parametric surfaces based on long experience in developing intersection algorithms for industrial use, is presented. In addition two novel methods that help improve quality and performance of intersection algorithms are described: An initial assessment of the intersection complexity to identify most transversal intersections, and to identify surface regions with possible complex intersection topology. To find regions where the surfaces possibly intersect, and regions where surface normals possibly are parallel, the computational power of multi-core CPUs and programmable graphics processors (GPUs) is used for subdivision of the surfaces and their normal fields. Approximate implicitization of surface regions to help analyse singular and near singular intersections.

Keywords: Intersection algorithm; recursive subdivision; approximate implicitization; programmable graphics cards (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-68783-2_3

Ordering information: This item can be ordered from
http://www.springer.com/9783540687832

DOI: 10.1007/978-3-540-68783-2_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().