Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24549
Title: Quadric decomposition for computing the intersections of surfaces of revolution
Authors: Jia, JY
Baciu, G 
Kwok, KW
Keywords: Surface intersection
Surface decomposition
Surface of revolution
Computer aided geometric design
Issue Date: 2004
Publisher: Academic Press Inc Elsevier Science
Source: Graphical models, 2004, v. 66, no. 5, p. 303-330 How to cite?
Journal: Graphical Models 
Abstract: Surface subdivision has been one of the most efficient techniques for surface representation, rendering, and intersection problems. General triangular and quadrilateral subdivision schemes often lead to data proliferation and increased computational load. In this paper, we propose a novel quadric decomposition method for computing intersection curves and present an efficient algorithm for solving the intersection problem of general surfaces of revolution. In our method, we decompose surfaces of revolution into a sequence of coaxial revolute quadrics and reduce the intersection problem for two surfaces of revolution to the intersection problem for two revolute quadrics. We present the performance of our method in the context of some of the most efficient and well-known solutions proposed so far by Kim [11] and our previous method based on truncated cone decomposition [1]. We give the performance characterization and show that this method is significantly more robust and efficient than previous methods.
URI: http://hdl.handle.net/10397/24549
ISSN: 1524-0703
DOI: 10.1016/j.gmod.2004.05.007
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

51
Last Week
4
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.