Abstract
The topological step of a subdivision scheme can be described as a refinement on regular tiling lattices, or more generally as a local transformation descriptor. The former classifies all the regular lattice transformations which give rise to other regular lattices. These regular lattice descriptors are limited by the type of the control mesh faces, the subdivided mesh must be composed by faces of the same type. The latter category describes some local topological transformations as the insertion of vertices in each face, followed by the description of a connectivity; such a descriptor is called meta-scheme. But these meta-schemes cannot describe a large number of regular refinements. We propose a topological descriptor that generalizes meta-schemes. Our descriptor is locally defined by a triple of integers which describes the number of inserted vertices relatively to the components of each face: vertices, edges and the face center. It is combined with a flexible connectivity descriptor which enhances modeling capability. Our descriptor can build the schemes commonly used and it can describe a variety of others, including many regular rotative schemes. We ensure the conservation of the control mesh global topology. The subdivision operators described here can be concatenated, leading to more complex topological descriptions. In addition, we propose a general geometric smoothing step.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ivrissimtzis, I., Dodgson, N.A., Sabin, M.A.: A generative classification of mesh refinement rules with lattice transformations. Computer Aided Geometric Design 21(1), 99–109 (2004)
Loop, C.: Smooth subdivision surfaces based on triangles. Master’s thesis, University of Utah (1987)
Catmull, E., Clark, J.: Recursively generated B-spline surfaces on arbitrary topological meshes. Computer Aided Design 10(6), 350–355 (1978)
Kobbelt, L.: \(\sqrt{3}\)-subdivision. In: SIGGRAPH 2000 Conference Proceddings, pp. 103–112 (2000)
Kohler, M.: A meta scheme for iterative refinement of meshes. In: Hege, H.C., Polthier, K. (eds.) Mathematical Visualization, pp. 45–59. Springer, Heidelberg (1998)
Müller, H., Rips, M.: Another metascheme of subdivision surfaces. In: Hege, H.C., Polthier, K. (eds.) Visualization and Mathematics III, pp. 201–220. Springer, Heidelberg (2003)
Alexa, M.: Refinement operators for triangle meshes. Comput. Aided Geom. Des. 19(3), 169–172 (2002)
Ivrissimtzis, I., Dodgson, N., Sabin, M.: \(\sqrt{5}\)-subdivision. In: Dodgson, N., Floater, M., Sabin, M. (eds.) Advances in Multiresolution for Geometric Modelling, pp. 285–300. Srpinger, Berlin (2004)
Dodgson, N.A.: An heuristic analysis of the classification of bivariate subdivision schemes. In: IMA Conference on the Mathematics of Surfaces, pp. 161–183 (2005)
Doo, D.: A subdivision algorithm for smoothing down irregularly shaped polyhedrons. In: Proceedings on Interactive Techniques in Computer Aided Design, pp. 157–165 (1978)
Dyn, N., Levin, D., Liu, D.: Interpolating convexity-preserving subdivision schemes for curves and surfaces. Computer-Aided Design 24(4), 211–216 (1992)
Stam, J., Loop, C.: Quad/triangle subdivision. Graphics Forum 22(1), 79–85 (2002)
Wachspress, E.: A rational finite element basis. Mathematics in Science and Engineering (1975)
Floater, M.S.: Mean value coordinates. Comput. Aided Geom. Des. 20(1), 19–27 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Destelle, F., Gérot, C., Montanvert, A. (2010). A Topological Lattice Refinement Descriptor for Subdivision Schemes. In: Dæhlen, M., Floater, M., Lyche, T., Merrien, JL., Mørken, K., Schumaker, L.L. (eds) Mathematical Methods for Curves and Surfaces. MMCS 2008. Lecture Notes in Computer Science, vol 5862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11620-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-11620-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11619-3
Online ISBN: 978-3-642-11620-9
eBook Packages: Computer ScienceComputer Science (R0)