[Paper Review] On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches

Jean Gallier|ArXiv.org|Jun 13, 2006

Advanced Numerical Analysis Techniques9 references3 citations

TL;DR

This paper presents optimal and efficient algorithms for subdividing polynomial triangular surface patches using the de Casteljau algorithm. It introduces a four-call method for regular subdivision (proven optimal), a three-call diamond-shaped subdivision, and a four-call spider-web subdivision producing six subtriangles, all minimizing computational calls while maintaining geometric accuracy.

ABSTRACT

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.

Motivation & Objective

• To minimize the number of de Casteljau algorithm calls required for subdividing polynomial triangular surface patches.
• To develop efficient subdivision strategies that reduce computational overhead compared to naive approaches.
• To explore alternative subdivision patterns—diamond-like and spider-web-like—beyond standard regular subdivision.
• To prove the theoretical lower bound on de Casteljau calls for regular subdivision.
• To demonstrate practical applicability through recursive subdivision examples and visual patterns.

Proposed method

• A regular subdivision strategy using four calls to the standard de Casteljau algorithm, proven optimal by showing no method can achieve it in fewer than four calls.
• A diamond-shaped subdivision pattern achieved in three calls by recursively splitting subtriangles using barycentric coordinates and selective net retention.
• A spider-web subdivision scheme producing six subtriangles in four calls, leveraging the center of gravity and recursive splitting of three initial subtriangles.
• Use of the sdecas3 function to compute control nets for subtriangles, with selective discarding of unwanted subnets to optimize computation.
• Application of polar forms and multiaffine symmetric maps to represent polynomial surfaces and derive control point relationships.
• Implementation of recursive subdivision with visual patterns such as Sierpinski gasket effects when omitting the central triangle.

Experimental results

Research questions

• RQ1 What is the minimum number of de Casteljau algorithm calls required to perform a regular subdivision of a polynomial triangular patch?
• RQ2 Can a non-regular subdivision pattern be constructed with fewer than four calls to the de Casteljau algorithm while still producing a valid partition?
• RQ3 What geometric subdivision patterns can be generated using four calls to the de Casteljau algorithm, and how do they compare in efficiency and structure?
• RQ4 How do alternative subdivision schemes like diamond-like or spider-web patterns affect the distribution and number of resulting subtriangles?
• RQ5 What visual or fractal-like effects emerge from recursive subdivision when the central triangle is omitted?

Key findings

• The proposed regular subdivision algorithm uses exactly four calls to the de Casteljau algorithm, which is proven to be the theoretical minimum, making it optimal.
• A diamond-shaped subdivision strategy achieves valid partitioning in only three calls, outperforming the naive twelve-call approach.
• A spider-web subdivision scheme produces six subtriangles using four calls, demonstrating a new class of efficient, non-regular subdivision patterns.
• The regular subdivision method, when recursively applied and with the central triangle omitted, generates a Sierpinski gasket-like fractal pattern on the surface patch.
• All proposed methods are applicable to rational surface patches through straightforward extension of the control net techniques.
• The use of barycentric coordinates and selective retention of control nets enables efficient computation without redundant calls to the de Casteljau algorithm.