Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/1982

Biconic subdivision of surfaces of revolution and its applications in intersection problems

Authors Jia, JY
Tang, K
Joneja, A
Issue Date 2004
Source VISUAL COMPUTER , v. 20, (7), 2004, SEP, p. 457-478
Summary This paper presents a novel method for the subdivision of surfaces of revolution. We develop a new technique for approximating the genertrix by a series of pairs of conic sections. By using an error estimate based on convex combination, an efficient least-squares approach is proposed that yields near-optimal fitting. The resulting surface approximation is shown to be more efficient than other tessellation methods in terms of the number of fitting segments. This in turn allows us to implement efficient and robust algorithms for such surfaces. In particular, novel intersection techniques based on the proposed subdivision method are introduced for the two most fundamental types of intersections - line/surface and surface/surface intersections. The experimental results show that our method outperforms conventional methods significantly in both computing time and memory cost.
Subjects
ISSN 0178-2789
Rights The original publication is available at http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00371-004-0252-4
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Find@HKUST
Files in this item:
File Description Size Format
BiConic.pdf 3025688 B Adobe PDF