An O(n^2log n) time algorithm for the MinMax angle triangulation
Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52.
Download
No fulltext has been uploaded. References only!
Conference Paper
| Published
| English
Author
Edelsbrunner, HerbertISTA 
;
Tan, Tiow;
Waupotitsch, Roman
;
Tan, Tiow;
Waupotitsch, RomanAbstract
We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.
Publishing Year
Date Published
1990-01-01
Proceedings Title
Proceedings of the 6th annual symposium on Computational geometry
Publisher
ACM
Page
44 - 52
Conference
SCG: Symposium on Computational Geometry
Conference Location
Berkley, CA, United States
Conference Date
1990-06-07 – 1990-06-09
ISBN
IST-REx-ID
Cite this
Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2log n) time algorithm for the MinMax angle triangulation. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:44-52. doi:10.1145/98524.98535
Edelsbrunner, H., Tan, T., & Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In Proceedings of the 6th annual symposium on Computational geometry (pp. 44–52). Berkley, CA, United States: ACM. https://doi.org/10.1145/98524.98535
Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” In Proceedings of the 6th Annual Symposium on Computational Geometry, 44–52. ACM, 1990. https://doi.org/10.1145/98524.98535.
H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 44–52.
Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52.
Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.
Google Scholar
ISBN Search