Approximation algorithms for some optimal 2D and 3D triangulations

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 50-1-50-16

  Fung, Stanley P Y ^a   Wang, Cao An ^b   Chin, Francis Y L ^c  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84959397517     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (68)

1. Bagemihl, F., On indecomposable polyhedra, Am. Math. Mon., 55(7), 411, 1948.
2. Bern, M. and Eppstein, D., Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, 2nd ed., Du, D.-Z. and Hwang, F. K., Eds., World Scientific, Singapore, 1995, p. 47.
3. Castillo, J. E., Ed., Mathematical aspects of numerical grid generation, SIAM, 1991.
4. Chazelle, B., Triangulating a simple polygon in linear time, Disc. and Comput. Geom., 6, 485, 1991.
5. Edelsbrunner, H., Tan, T. S., and Waupotitsch, R., A polynomial time algorithm for the minmax angle triangulation, SIAM J. Sci. Stat. Comp., 13, 994, 1992.
6. Edelsbrunner, H. and Tan, T. S., A quadratic time algorithm for the minmax length triangulation, Proc. of FOCS, 1991, p. 414.
7. Fortune, S., Voronoi diagrams and Delaunay triangulations, in Computing in Euclidean Geometry, Hwang, F. K. and Du, D.-Z., Eds., World Scientific, Singapore, 1992.
8. Aurenhammer, F., Voronoi diagrams—a survey of a fundamental geometric data structure, ACM Comput. Surv., 23, 345, 1991.
9. Chew, L. P., Constrained Delaunay triangulations, Algorithmica, 4, 97, 1989.
10. Wang, C. and Schubert, L., An optimal algorithm for constructing the Delaunay triangulation of a set of line segments, Proc. 3rd ACM Symp. on Comput. Geom., 1987, p. 223.
11. Chin, F. and Wang, C. A., Finding the constrained Delaunay triangulation and constrained voronoi diagram of a simple polygon in linear-time, SIAM J. Comput., 28(2), 471, 1998.
12. Levcopoulos, C. and Lingas, A., Fast algorithms for greedy triangulation. BIT, 32, 280, 1992.
13. Düppe, R. D. and Gottschalk, H. J., Automatische Interpolation von Isolinien bei willk ürlichen Stützpunkten, Allgemeine Vermessungsnachrichten, 77, 423, 1970.
14. Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NPCompleteness, W. H. Freeman, San Francisco, CA, 1979.
15. Keil, J. M., Computing a subgraph of the minimum weight triangulation, Comput. Geom.: Theor. Appl., 4, 13, 1994.
16. Wang, C. A., Chin, F. Y. L., and Xu, Y., A new subgraph of minimum weight triangulations, J. Comb. Opt., 1(2), 115, 1997.
17. Wang, C. A., Chin, F. Y. L., and Yang, B., Triangulations without minimum-weight drawing, Inf. Proc. Lett., 74(5–6), 183, 2000.
18. Wang, C. A., Chin, F. Y. L., and Yang, B. T., Maximum weight triangulation and graph drawing, Inf. Proc. Lett., 70(1), 17, 1999.
19. Schönhardt, E., Uber die Zerlegung von Dreieckspolyedern in Tetraeder, Math. Annalen., 98, 309, 1928.
20. Ruppert, J. and Seidel, R., On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra, Disc. Comput. Geom., 7, 227, 1992.
21. Chin, F. and Wang, C. A., On the difficulty of greedy tetrahedralization of points in 3D, Proc. 7th Canadian Conf. on Comput. Geom., 1995, p. 285.
22. Yang, B., Wang, C. A., and Chin, F. Y. L., Algorithms and complexity for tetrahedralization detections, Proc. 13th Int. Symp. on Algorithms and Computation, 2002, p. 296.
23. Chazelle, B. and Palios, L., Triangulating a nonconvex polytope, Disc. Comput. Geom., 5, 505, 1990.
24. Below, A., De Loera, J., and Richter-Gebert, J., The complexity of finding small triangulations of convex 3-polytopes, J. Algorithms, 50(2), 134, 2004.
25. Wang, C. A. and Yang, B., Optimal tetrahedralizations of some convex polyhedra, EuropeanWorkshop on Comput. Geom., 2000, p. 5.
26. Yang, B. and Wang, C. A., Minimal tetrahedralizations of a class of polyhedra, J. Comb. Opt., 8(3), 241, 2004.
27. Shamos, M. I. and Hoey, D., Closest point problems, Proc. of FOCS, 1975, p. 151.
28. Gilbert, P., New Results on Planar Triangulations, Technical Report ACT-15, Coord. Sci. Lab., University of Illinois at Urbana, 1979.
29. Klincsek, G., Minimal triangulations of polygonal domains, Ann. Discrete Math., 9, 121, 1980.
30. Anagnostou, E. and Corneil, D., Polynomial time instances of the minimum weight triangulation problem, Comput. Geom.: Theor. Appl., 3, 247, 1993.
31. Cheng, S.-W., Golin, M., and Tsang, J., Expected case analysis of β-skeletons with applications to the construction of minimum weight triangulations, Proc. 7th Canadian Conf. on Comput. Geom., 1995, p. 279.
32. Das, G. and Joseph, D., Which triangulations approximate the complete graph? Proc. Int. Symp. on Optimal Algorithms, Lecture Notes in Computer Science, Vol. 401, Springer, Berlin, 1989, p. 168.
33. Yang, B. T., Xu, Y. F., and You, Z. Y., A chain decomposition algorithm for the proof of a property on minimum weight triangulations, Proc. 5th Int. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 834, Springer, Berlin, 1994, p. 423.
34. Cheng, S.-W. and Xu, Y.-F., Approaching the largest β-skeleton within a minimum weight triangulation, Proc. 12th ACM Symp. on Comput. Geom., 1996, p. 196.
35. Wang, C. and Yang, B., A lower bound for β-skeleton belonging to minimum weight triangulations, Comput. Geom.: Theor. and Appl., 19(1), 35, 2001.
36. Meijer, H. and Rappaport, D., Computing the minimum weight triangulation of a set of linearly ordered points, Inf. Proc. Lett., 42(1), 35, 1992.
37. Wang, C. and Xu, Y., Computing a minimum weight triangulation of a sparse point set, J. Global Opt., 15, 73, 1999.
38. Hoffmann, M. and Okamoto, Y., The minimum weight triangulation problem with few inner points. Proc. 1st Int.Workshop on Parameterized and Exact Computation, LectureNotes in Computer Science, Vol. 3162, Springer, Berlin, 2004, p. 200.
39. Grantson, M., Borgelt, C., and Levcopoulos, C., Minimum weight triangulation by cutting out triangles, Proc. 16th Int. Symp. on Algorithms and Computation, 2005.
40. Mirzaian, A., Wang, C., and Xu, Y., On stable line segments in triangulations, Proc. 8th Canadian Conf. on Comput. Geom., 1996, p. 62.
41. Dickerson, M. T. and Montague, M. H., A (usually?) connected subgraph of the minimum weight triangulation, Proc. 12th ACM Symp. on Comput. Geom., 1996, p. 204.
42. Dai, Y. and Katoh, N., On computing new classes of optimal triangulations with angular constraints, Proc. 4th Int. Conf. of Computing and Combinatorics, Lecture Notes in Computer Science, Vol. 1449, Springer, Berlin, 1998, p. 15.
43. Bose, P., Devroye, L., and Evans, W., Diamonds are not a minimumweight triangulation’s best friend, Proc. 8th Canadian Conf. on Comput. Geom., 1996, p. 68.
44. Drysdale, R. L., McElfresh, S., and Snoeyink, J., On exclusion regions for optimal triangulations, Disc. Appl. Math., 109 (1–2), 49, 2001.
45. Kirkpatrick, D. G., A note on Delaunay and optimal triangulations, Info. Proc. Lett., 10(3), 127, 1980.
46. Levcopoulos, C., AnΩ(√ n) lower bound for the nonoptimality of the greedy triangulation, Inf. Proc. Lett., 25, 247, 1987.
47. Lingas, A., A new heuristic for minimum weight triangulation, SIAM J. Algebraic Disc. Meth., 8(4), 646, 1987.
48. Heath, L. and Pemmaraju, S., New results for the minimum weight triangulation problem, Algorithmica, 12(6), 533, 1994.
49. Levcopoulos, C. and Krznaric, D., Tight lower bounds for minimum weight triangulation heuristics, Inf. Proc. Lett., 57(3), 129, 1996.
50. Levcopoulos, C. and Krznaric, D., Quasi-greedy triangulations approximating the minimum weight triangulation, J. Algorithms, 27(2), 303, 1998.
51. Plaisted, D. A. and Hong, J., A heuristic triangulation algorithm, J. Algorithms, 8(3), 405, 1987.
52. Levcopoulos, C. and Lingas, A., On approximation behavior of the greedy triangulation for convex polygons, Algorithmica, 2, 175, 1987.
53. Levcopoulos, C. and Krznaric, D., A linear-time approximation scheme for minimum weight triangulation of convex polygons, Algorithmica, 21(3), 285, 1998.
54. Chang, R. C. and Lee, R. C. T., On the average length of Delaunay triangulations, BIT, 24(3), 269, 1984.
55. Levcopoulos, C. and Lingas, A., The greedy triangulation approximates the minimum weight triangulation and can be computed in linear time in the average case, Technical report LU-CS-TR:92-105, Department of Computer Science, Lund University, Sweden, 1992. Preliminary version in Proc. ICCI ’91, Lecture Notes in Computer Science, p. 497.
56. Hu, S., A constant-factor approximation for maximum weight triangulation, Proc. 15th Canadian Conf. on Comput. Geom., 2003, p. 150.
57. Chin, F., Qian, J., andWang, C., Progress on maximum weight triangulation, Proc. 10th Int. Conf. on Computing and Combinatorics, 2004, p. 53.
58. Qian, J. and Wang, C. A., A linear-time approximation scheme for maximum weight triangulation of convex polygons, Algorithmica, 40, 161, 2004.
59. Edelsbrunner, H., Preparata, F. P., and West, D. B., Tetrahedrizing point sets in three dimensions, J. Symbolic Comput., 10, 335, 1990.
60. Below, A., Brehm, U., De Loera, J. A., and Richter-Gebert, J., Minimal simplicial dissections and triangulations of convex 3-polytopes, Disc. Comput. Geom., 24(1), 35, 2000.
61. Richter-Gebert, J., Finding small triangulations of polytope boundaries is hard, Discrete Comput. Geometry, 24, 503, 2000.
62. Chin, F.Y. L., Fung, S. P.Y., andWang, C. A., Approximation for minimumtriangulations of simplicial convex 3-polytopes, Disc. Comput. Geom., 26(4), 499, 2001.
63. Papadimitriou, C. H. and Yannakakis, M., The clique problem for planar graphs, Inf. Proc. Lett., 13, 131, 1981.
64. Chiba, N. and Nishizeki, T., Arboricity and subgraph listing algorithms, SIAM J. Comput., 14(1), 210, 1985.
65. Fung, S. P. Y., Chin, F. Y. L., and Poon, C. K., Approximating the minimum triangulation of convex polytopes with bounded degrees, Comput. Geom.: Theor. Appl., 32(1), 1, 2005.
66. O’Rourke, J., Computational geometry column 40, Int. J. Comput. Geom. and Appl., 10(6), 649, 2000.
67. Cheng, S.-W. and Dey, T. K., Approximateminimumweight steiner triangulation in three dimensions, Proc. of SODA, 1999, p. 205.
68. Mulzer, W. and Rote, G., Minimum weight triangulation is NP-hard, Proc. 22nd Symposium on Computational Geometry, 2006, pp. 1–10.