On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches

Details On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches

2006-06-13

arxiv.org/abs/cs/0606061v1

Computer Science

Computational Geometry

20 pages

Scientific paper

In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivision in four calls to the standard de Casteljau algorithm (in its subdivision version). A naive version uses twelve calls. We also show that any method for obtaining a regular subdivision using the standard de Casteljau algorithm requires at least 4 calls. Thus, our method is optimal. We give another subdivision algorithm using only three calls to the de Casteljau algorithm. Instead of being regular, the subdivision pattern is diamond-like. Finally, we present a ``spider-like'' subdivision scheme producing six subtriangles in four calls to the de Casteljau algorithm.

Affiliated with

Also associated with

No associations

Rating

On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-45939