Published June 2003 | Version Erratum + Submitted
Journal Article Open

Composite primal/dual √3-subdivision schemes

  • 1. ROR icon California Institute of Technology

Abstract

We present new families of primal and dual subdivision schemes for triangle meshes and 3-refinement. The proposed schemes use two simple local rules which cycle between primal and dual meshes a number of times. The resulting surfaces become very smooth at regular vertices if the number of cycles is ⩾2. The C^1-property is violated only at low-valence irregular vertices, and can be restored by slight modifications of the local rules used. As a generalization, we introduce a wide class of composite subdivision schemes suitable for arbitrary topologies and refinement rules. A composite scheme is defined by a simple upsampling from the coarse to a refined topology, embedded into a cascade of geometric averaging operators acting on coarse and/or refined topologies. We propose a small set of such averaging rules (and some of their parametric extensions) which allow for the switching between control nets associated with the same or different topologic elements (vertices, edges, faces), and show a number of examples, based on triangles, that the resulting class of composite subdivision schemes contains new and old, primal and dual schemes for 3-refinement as well as for quadrisection. As a common observation from the examples considered, we found that irregular vertex treatment is necessary only at vertices of low valence, and can easily be implemented by using generic modifications of some elementary averaging rules.

Additional Information

© 2003 Elsevier Science. Received 15 October 2002, Revised 7 March 2003, Accepted 7 March 2003, Available online 10 April 2003. The work of the second author was supported in part by NSF (DMS-9874082, ACI-9721349, DMS-9872890, ACI-9982273), Lucent, Intel, Alias|Wavefront, Pixar, Microsoft, and the Packard Foundation.

Errata

Peter Oswald, Peter Schröder, Corrigendum to: 'Composite primal/dual 3-subdivision schemes': [COMAID 20 (2003) 135–164], Computer Aided Geometric Design, Volume 20, Issue 5, 2003, Page 295, ISSN 0167-8396, https://doi.org/10.1016/S0167-8396(03)00073-6.

Attached Files

Submitted - download?amp=_amp=_doi=10.1.1.61.9901_rep=rep1_type=pdf.pdf

Erratum - 1-s2.0-S0167839603000736-main.pdf

Files

1-s2.0-S0167839603000736-main.pdf

Files (32.4 kB)

Name Size
md5:4fddcfca062f18d821a76daab879d22b
32.4 kB Preview Download

Additional details

Identifiers

Eprint ID
76198
Resolver ID
CaltechAUTHORS:20170408-163038224

Funding

NSF
DMS-9874082
NSF
ACI-9721349
NSF
DMS-9872890
NSF
ACI-9982273
Lucent
Intel
Alias|Wavefront
Pixar
Microsoft
David and Lucile Packard Foundation

Dates

Created
2018-03-07
Created from EPrint's datestamp field
Updated
2023-06-01
Created from EPrint's last_modified field