A linear-time approximation scheme for minimum weight triangulation of convex polygons

Algorithmica (New York)

Volumn 21, Issue 3, 1998, Pages 285-311

  Levcopoulos, C ^a   Krznaric, D ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Approximation scheme; Computational geometry; Convex polygons; Minimum weight; Partitions; Triangulation

Indexed keywords

EID: 0006890703     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009216     Document Type: Article

References (18)

1. P. Yoeli. Compilation of data for computer-assisted relief cartography. In J. C. Davis and M. J. McCullagh, editors, Display and Analysis of Spatial Data, pages 352-367. Wiley, New York, 1975.
2. P. D. Gilbert. New results in planar triangulations. Master's thesis, University of Illinois, Urbana, IL, 1979.
3. P. Belleville, M. Keil, M. McAllister, and J. Snoeyink. On computing edges that are in all minimum-weight triangulations. In Proceedings of the 12th Annual ACM Symposium on Computational Geometry, pages V7-V8, 1996.
4. M. T. Dickerson and M. H. Montague. A (usually?) connected subgraph of the minimum weight triangulation. In Proceedings of the 12th Annual ACM Symposium on Computational Geometry, pages 204-213, 1996.
5. D. A. Plaisted and J. Hong. A heuristic triangulation algorithm. Journal of Algorithms, 8(3):405-437, 1987.
6. C. Levcopoulos and D. Krznaric. Quasi-greedy triangulations approximating the minimum weight triangulation. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, pages 392-401, 1996.
7. W. D. Smith. Studies in Computational Geometry Motivatedby Mesh Generation. Ph.D. thesis, Princeton University, Princeton, NJ, 1989.
8. C. Levcopoulos and D. Krznaric. The greedy triangulation can be computed from the Delaunay in linear time. Technical Report LU-CS-TR:94-136, Department of Computer Science, Lund University, Lund, 1994.
9. C. Levcopoulos and D. Krznaric. A fast heuristic for approximating the minimum weight triangulation. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory, volume 1097 of Lecture Notes in Computer Science, pages 296-308. Springer-Verlag, Berlin, 1996.
10. A. Lingas. A linear-time heuristic for minimum weight triangulation of convex polygons. In Proceedings of the 23rd Allerton Conference on Communication, Control and Computing, page 480-485, 1985.
11. C. Levcopoulos and A. Lingas. On approximation behavior of the greedy triangulation for convex polygons. Algorithmica, 2(2):175-193, 1987.
12. C. Levcopoulos and A. Lingas. Fast algorithms for greedy triangulation. BIT, 32:280-296, 1992.
13. V. Kantabutra. A linear-time near-optimum-length triangulation algorithm for convex polygons. Journal of Computer and System Sciences, 49(2):325-333, 1994.
14. C. Levcopoulos, A. Lingas, and J.-R. Sack. Heuristics for optimum binary search trees and minimum weight triangulation problems. Theoretical Computer Science, 66:181-203, 1989.
15. J. M. Keil. Computing a subgraph of the minimum weight triangulation. Computational Geometry: Theory & Applications, 4:13-26, 1994.
16. A. Aggarwal, L. Guibas, J. Saxe, and P. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete & Computational Geometry, 4:591-604, 1989.
17. L. P. Chew. Building Voronoi diagrams for convex polygons in linear expected time. Technical Report PCS-TR90-147, Department of Mathematics and Computer Science, Dartmouth College, Hanover, NH, 1990.
18. R. Klein and A. Lingas. A note on generalizations of Chew's algorithm for the Voronoi diagram of a convex polygon. In Proceedings of the 5th Canadian Conference on Computational Geometry, pages 124-132, 1993.