Andere Kunden interessierten sich auch für
![Point Set Triangulation]( "Point Set Triangulation")
Point Set Triangulation22,99 €![Computational Geometry]( "Computational Geometry")
Computational Geometry49,99 €![Computational Geometry]( "Computational Geometry")
Computational Geometry92,99 €![Triangulation]( "Triangulation")
Triangulation22,99 €![Generalized Curvatures]( "Generalized Curvatures")
Generalized Curvatures93,99 €![Tutorials on Multiresolution in Geometric Modelling]( "Tutorials on Multiresolution in Geometric Modelling")
Tutorials on Multiresolution in Geometric Modelling39,99 €![Effective Computational Geometry for Curves and Surfaces]( "Effective Computational Geometry for Curves and Surfaces")
Effective Computational Geometry for Curves and Surfaces77,99 €
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational geometry, a Pitteway triangulation is a point set triangulation in which the nearest neighbor of any point p within the triangulation is one of the vertices of the triangle containing p. Alternatively, it is a Delaunay triangulation in which each internal edge crosses its dual Voronoi diagram edge. Pitteway triangulations are named after Michael Pitteway, who studied them in 1973. Not every point set supports a Pitteway triangulation. When such a triangulation exists it is a special case of the Delaunay triangulation, and consists of the union of the Gabriel graph and convex hull.