Skip to main content

Combinatorial Properties of Subdivision Meshes

  • Conference paper
Mathematics of Surfaces

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2768))

  • 772 Accesses

Abstract

In this paper we study subdivision from a graph-theoretic point of view. In particular, we study the chromatic numbers of subdivision meshes, that is the number of distinct colors we need for a vertex, face or edge coloring of a subdivision mesh. We show that, unlike the size, the chromatic numbers of subdivision meshes are not larger than the corresponding chromatic numbers of the initial mesh and sometimes are even smaller.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ivrissimtzis, I., Dodgson, N., Sabin, M.: A generative classification of mesh refinement rules with lattice transformations. Research Report UCAM-CL-TR-542, Cambridge University, Cambridge, UK (2002)

    Google Scholar 

  2. Doo, D., Sabin, M.: Behaviour of recursive division surfaces near extraordinary points. Computer-Aided Design 10 (1978) 356–360

    Google Scholar 

  3. Loop, C.T.: Smooth subdivision surfaces based on triangles (1987)

    Google Scholar 

  4. Kobbelt, L.: sqrt(3) subdivision. In: Siggraph 00, Conference Proceedings. (2000) 103–112

    Google Scholar 

  5. Catmull, E., Clark, J.: Recursively generated B-spline surfaces on arbitrary topological meshes. Computer-Aided Design 10 (1978) 350–355

    Google Scholar 

  6. Jensen, T.R., Toft, B.: Graph coloring problems. New York, NY: John Wiley & Sons. (1995)

    Google Scholar 

  7. Tutte, W.: A census of planar triangulations. Can. J. Math. 14 (1962) 21–38

    Google Scholar 

  8. Ivrissimtzis, I., Seidel, H.P.: Polyhedra operators for mesh refinement. In: Proceedings of Geometric Modeling and Processing 2002, Wako, Saitama, Japan, IEEE (2002) 132–137

    Google Scholar 

  9. Grannell, M., Griggs, T., Sirn, J.: Face 2-colourable triangular embeddings of complete graphs. J. Comb. Theory, Ser. B 74 (1998) 8–19

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ivrissimtzis, I., Seidel, HP. (2003). Combinatorial Properties of Subdivision Meshes. In: Wilson, M.J., Martin, R.R. (eds) Mathematics of Surfaces. Lecture Notes in Computer Science, vol 2768. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39422-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39422-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20053-6

  • Online ISBN: 978-3-540-39422-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics