A Caltech Library Service

Is this a Quadrisected Mesh?

Taubin, Gabriel (2000) Is this a Quadrisected Mesh? California Institute of Technology , Pasadena, CA. (Unpublished)

Postscript - Submitted Version
See Usage Policy.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


In this paper we introduce a fast and efficient linear time and space algorithm to detect and reconstruct uniform Loop subdivision structure, or triangle quadrisection, in irregular triangular meshes. Instead of a naive sequential traversal algorithm, and motivated by the concept of covering surface in Algebraic Topology, we introduce a new algorithm based on global connectivity properties of the covering mesh. We consider two main applications for this algorithm. The first one is to enable interactive modeling systems that support Loop subdivision surfaces, to use popular interchange file formats which do not preserve the subdivision structure, such as VRML, without loss of information. The second application is to improve the compression efficiency of existing lossless connectivity compression schemes, by optimally compressing meshes with Loop subdivision connectivity. Extensions to other popular uniform primal subdivision schemes such as Catmul-Clark, and dual schemes such as Doo-Sabin, are relatively strightforward but will be studied elsewhere.

Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription ItemArticle Related ItemArticle
Additional Information:© 2000 California Institute of Technology.
Group:Computer Science Technical Reports
Record Number:CaltechCSTR:2000.008
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26821
Deposited By: Imported from CaltechCSTR
Deposited On:25 Apr 2001
Last Modified:03 Oct 2019 03:18

Repository Staff Only: item control page