Globally-Equiangular triangulations of co-circular points in 0(n log n) time
暂无分享,去创建一个
One important property of Delaunay triangulations is that they maximizes the minimum angle of all the angles tha t are present in the triangulation. Moreover, as Herbert Edelsbrunner has pointed out [1], when points are in general position, the Delannay triangulation produces the lexicographically largest increasing sequence of angles possible in any triangulation. This means that if the angles of the Delaunay triangulation are listed in non-decreasing order:
[1] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[2] Roland Glowinski,et al. An introduction to the mathematical theory of finite elements , 1976 .
[3] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .