Internet-Journal "Computer Graphics & Geometry"
Main Page
About Journal
Journal Issues
Subscription
Editorial Board
Notes for Authors

 
   
   

COMPUTER GRAPHICS & GEOMETRY

Issue Year: 2005
Date: Spring
Volume: 7
Number: 1
Pages: 46-60

Article Name: EFFICIENTLY COMPUTING INTERSECTION CURVES OF A PLANE AND A SURFACE OF REVOLUTION
Authors: Jinyuan Jia, Kai Tang, AJAY JONEJA, Ki-Wan Kwok
Address: Jinyuan Jia , Liaoning University of Petroleum &Chemistry Technology, Fushun, Liaoning Province, P. R. China, 113001 Zhuhai College, Jilin University, Zhuhai, Guangdong Province, P. R. China, 519041 Kai Tang , The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong Ajay Joneja joneja @ust.hk, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong Ki-Wan Kwok , Dept. of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Abstract:

Computing the planar sections of objects is a fundamental operation in solid modeling. Subdivision method is commonly used for solving such intersection problems. In this paper, a novel revolute quadric decomposition is proposed for surfaces of revolution, which are subdivided into a set of coaxial revolute quadrics along the generatrix. This reduces the intersection problem of a plane and a surface of revolution to the intersection problem of a plane and a revolute quadric, which has robust, accurate and efficient geometric solution. Further, the intersection curves can be represented with a group of G1 conic arcs. A new concept, valid intersection interval (VII), is introduced and a new technique, cylindrical bounding shell clipping, is proposed for efficient intersection detection for a plane and a surface of revolution. Finally, a tracing algorithm is presented for recognizing singular points and closed loops of intersection curves. Implemented examples show the robustness and effectiveness of the proposed algorithm

Open Article   Download ZIP archive

Issue contents