A tracing method for parametric Bezier triangular surface/plane intersection
by R. Sharma, O.P. Sha
International Journal of Computer Applications in Technology (IJCAT), Vol. 28, No. 4, 2007

Abstract: This paper presents, in the general setting of derivational continuities, a surface/plane intersection algorithm based on a tracing method in which the intersection curves are traced out in the direction of tangent vectors at intersection points for parametric Bezier triangular surface over triangular domain. The intersection curves are given by ordered pairs of surface domain points, and are represented by their piece-wise polynomial approximations. The aim is to obtain the smallest number of structured and ordered points that correctly represent the topology of the true intersection curves without any sorting required. The intersection curve is plotted by fitting an interpolatory cubic spline, and its refinement may include adding or deleting points. The method has been used to compute different planar sections for different derivationally continuous surfaces.

Online publication date: Mon, 16-Jul-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com