Special cases where this relationship does not hold, or is ambiguous, include cases like: Three or more collinear points, where the circumcircles are of infinite radii. Four or more points on a perfect circle, where the triangulation is ambiguous and all circumcenters are trivially identical. In this case the Voronoi diagram contains vertices of degree four or greater and its dual graph contains polygonal faces with four or more sides. The various triangulations of these faces complete the various possible Delaunay triangulations. Edges of the Voronoi diagram going to infinity are not defined by this relation in case of a finite set . If the Delaunay triangulation is calculated using the Bowyer–Watson algorithm then the circumcenters of triangles having a common vertex with the "super" triangle should be ignored. Edges going to infinity start from a circumcenter and they are perpendicular to the common edge between the kept and ignored triangle.
Special cases where this relatio:nship does not hold, or is ambiguous, include cases like Three or more collinear points, where the circumcircles are of infinite radii. Four or more points on a perfect circle, where the triangulation is ambiguous and all circumcenters are trivially identical. In this case the Voronoi diagram contains vertices of degree four or greater and its dual graph contains polygonal faces with four or more sides. The various triangulations of these faces complete the various possible Delaunay triangulations. Edges of the Voronoi diagram going to infinity are not defined by this relation in case of a finite set . If the Delaunay triangulation is calculated using the Bowyer–Watson algorithm then the circumcenters of triangles having a common vertex with the "super" triangle should be ignored. Edges going to infinity start from a circumcenter and they are perpendicular to the common edge between the kept and ignored triangle.