1 Hit in 2.2 sec

An O(n2log n) time algorithm for the MinMax angle triangulation

Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch
1990 Proceedings of the sixth annual symposium on Computational geometry - SCG '90  
We s h o w that a triangulation o f a s e t o f n points in the plane that minimizes the maximum angle can be computed in time O(n 2 log n) and space O(n).  ...  The algorithm is fairly easy to implement and is based on the edge-insertion s c heme that iteratively improves an arbitrary initial triangulation.  ...  The second author thanks Professor C. L. Liu for his constant supports and encouragement.  ... 
doi:10.1145/98524.98535 dblp:conf/compgeom/EdelsbrunnerTW90 fatcat:ankg2lus6vezzbwk3ttpyom5hu