On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches

Simple item page
dc.creatorGallier, Jean
dc.date2006-06-13
dc.date.accessioned2026-07-07T07:13:04Z
dc.date.available2026-07-07T07:13:04Z
dc.descriptionIn 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.
dc.description20 pages
dc.identifierhttps://arxiv.org/abs/cs/0606061
dc.identifierhttp://arxiv.org/abs/cs/0606061
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112309
dc.subjectComputational Geometry
dc.subjectGraphics
dc.titleOn the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches
dc.typetext

Files

Collections

arXiv