In computer graphics applications, three-dimensional models are almost always represented using polygonal meshes. A mesh in its simplest form consists of a set of vertices, polygons, and optionally a number of additional vertex and polygonal attributes. The complexity of a mesh can vary from low to very high depending on requirements such as rendering quality, speed and resolution. A wide spectrum of mesh processing algorithms is used by graphics and game developers for a variety of applications such as generating, simplifying, smoothing, remapping and transforming meshes. Several types of data structures and file formats are also used to store mesh data.
This chapter discusses the geometrical and topological aspects related to three-dimensional meshes and their processing. It also presents important data structures and algorithms used for operations such as mesh simplification, mesh subdivision, planar embedding, and polygon triangulation.
KeywordsConvex Polygon Triangular Mesh Subdivision Scheme Simple Polygon Boundary Vertex
- Baumgart, B. (1972). Winged edge polyhedron representation (C. S. D. Stanford Artificial Intelligence Project, Trans.): Stanford University.Google Scholar
- Botsch, M. (2010). Polygon mesh processing. Natick: A K Peters.Google Scholar
- Foley, J. D. (1996). Computer graphics: Principles and practice (2nd ed. in C.). Reading/Wokingham: Addison-Wesley.Google Scholar
- Garland, M. (1999). Quadric-based polynomial surface simplification. Ph.D., Carnegie Mellon, Pittsburgh (CMU-CS-99-105).Google Scholar
- Kettner, L. (1998). Designing a data structure for polyhedral surfaces. In: Proceedings of the fourteenth annual symposium on Computational geometry, Minneapolis, Minnesota, United States.Google Scholar
- Kobbelt, L. (2000). Root3-subdivision. In: Proceedings of the 27th annual conference on Computer graphics and interactive techniques.Google Scholar
- Loop, C. (1987). Smooth subdivision surfaces based on triangles. M.Sc., The University of Utah, Utah.Google Scholar
- Melax, S. (1998, November). A simple, fast and effective polygon reduction algorithm. Game Developer, 44–49.Google Scholar
- Nielsen, F. (2005). Visual computing: Geometry, graphics, and vision. Hingham/London: Charles River Media/Transatlantic, (distributor).Google Scholar
- Saba, S., Yavneh, I., Gotsman, C., & Sheffer, A. (2005). Practical spherical embedding of manifold triangle meshes. In: Proceedings of the international conference on shape modeling and applications 2005, BostonGoogle Scholar
- Shirley, P., & Ashikhmin, M. (2007). Fundamentals of computer graphics (2nd ed.). Wellesley/London: AK Peters.Google Scholar
- Zorin, D. (2006). Subdivision of arbitrary meshes: Algorithms and theory (Institute of Mathematical Sciences lecture notes series). Singapore: World Scientific.Google Scholar