Quasi-greedy triangulations approximating the minimum weight triangulation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 392-401

  Levcopoulos, Christos ^a   Krznaric, Drago ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; TRIANGULATION;

APPROXIMATION RATIOS; CONSTANT FACTOR APPROXIMATION; CONSTANT FACTORS; LOWER BOUNDS; MINIMUM WEIGHT; MINIMUM WEIGHT TRIANGULATION; POLYNOMIAL-TIME ALGORITHMS; TIME BOUND;

SURVEYING;

EID: 84990217527     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. R. C. Chang and R. C. T. Lee, On the average length of Delaunay triangulations, BIT, 24 (1984), pp. 269-273.
2. G. Das and D. Joseph, Which triangulations approximate the complete graph, in Proc. Int. Symp. on Optimal Algorithms, LNCS 401 (1989), pp. 168-183.
3. M. T. Dickerson, R. L. S. Drysdale, S. A. McElfresh, and E. Welzl, Fast greedy triangulation algorithms, in Proc. 10th ACM Symp. on Comp. Geom. (1994), pp. 211-220.
4. P. D. Gilbert, New results in planar triangulations, MSc thesis, U. of Illinois, Urbana, 1979.
5. L. Heath and S. Pemmaraju, New results for the minimum weight triangulation problem, Algorithmica, 12 (1994), pp. 533-552.
6. D. G. Kirkpatrick, A note on Delaunay and optimal triangulations, Inf. Proc. Letters, 10 (1980), pp. 127-128.
7. C. Levcopoulos, An Ω(√n) lower bound for the nonoptimality of the greedy triangulation, Inf. Proc. Letters, 25 (1987), pp. 247-251.
8. C. Levcopoulos, Heuristics for minimum Decompositions of polygons, PhD thesis, Lindköping U., Sweden, 1987.
9. C. Levcopoulos and D. Krznaric, The greedy triangulation can be computed from the Delaunay in linear time, Tech. Report LU-CS-TR:94-136, Dep. of Comp. Sci., Lund U., Sweden, 1994.
10. C. Levcopoulos and D. Krznaric, Quasi-greedy triangulations approximating the minimum weight triangulation (revised version), Tech. Report LU-CS-TR:95-155, Dep. of Comp. Sci., Lund U., Sweden, 1995.
11. C. Levcopoulos and D. Krznaric, Tight lower bounds for minimum weight triangulation heuristics, Tech. Report LU-CS-TR:95-157, Dep. of Comp. Sci., Lund U., Sweden, 1995.
12. C. Levcopoulos and A. Lingas, On approximating behavior of the greedy triangulation for convex polygons, Algorithmica, 2 (1987), pp. 175-193.
13. C. Levcopoulos and A. Lingas, The greedy triangulation approximates the minimum weight triangulation and can be computed in linear time in the average case, Tech. Report LU-CS-TR:92-105, Dep. of Comp. Sci., Lund U., Sweden, 1992. A preliminary version appeared in Proc. ICCI '91, LNCS 497.
14. C. Levcopoulos and A. Lingas, G-sensitive triangulations approximate the minmax length triangulation, Tech. Report LU-CS-TR:93-118, Dep. of Comp. Sci., Lund U., Sweden, 1993. A preliminary version appeared in Proc. FST-TCS '92, LNCS 652.
15. A. Lingas, A new heuristic for the minimum weight triangulation, SIAM J. on Algebraic and Disc. Methods, 8 (1987), pp. 646-658.
16. E. L. Lloyd, On triangulations of a set of points in the plane, in Proc. 18th FOCS (1977), pp. 228-240.
17. G. K. Manacher and A. L. Zobrist, Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation, Inf. Proc. Letters, 9 (1979), pp. 31-34.
18. D. A. Plaisted and J. Hong, A heuristic triangulation algorithm, J. of Algorithms, 8 (1987), pp. 405-437.
19. P. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer, 1985.
20. W. D. Smith, Studies in Computational Geometry Motivated by Mesh Generation, PhD thesis, Princeton U., 1989.
21. P. Yoeli, Compilation of data for computer-assisted relief cartography, in J. C. Davis and M. J. McCullagh, eds., Display and Analysis of Spatial Data, Wiley, 1975.