With convex hulls and Voronoi diagrams, one of the most studied problems in Computational Geometry is that of constructing a triangulation of a polygon or of a set of sites. A triangulation is a partition of the domain defined by the input into triangles which meet only at shared sides. Since this kind of meshes are needed in all domains where the ambient space must be discretized, this structure must be studied on surfaces in addition to the plane.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
Clara I. Grima
- Springer Netherlands
- Chapter 7
Neuer Inhalt/© ITandMEDIA