A lower bound for β-skeleton belonging to minimum weight triangulations

Computational Geometry: Theory and Applications

Volumn 19, Issue 1, 2001, Pages 35-46

  Wang, Cao An ^a   Yang, Boting ^a  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

skeleton; Computational geometry; Lower bound; Minimum weight triangulation

Indexed keywords

EID: 0347140625     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00008-6     Document Type: Article

References (31)

1. Aichholzer O., Aurenhammer F., Chen S.W., Katoh N., Taschwer M., Rote G., Xu Y.F. Triangulations intersect nicely. Discrete Comput. Geom. 16:1996;339-359.
2. Aichholzer O., Aurenhammer F., Hainz R. New results on MWT subgraphs. Inform. Process. Lett. 69:1999;215-219.
3. Anagnostou E., Corneil D. Polynomial-time instances of the minimum weight triangulation problem. Computational Geometry. 3:1993;247-259.
4. Beirouti P., Snoeyink J. Implementations of the LMT heuristic for minimum weight triangulation. Proc. 14th ACM Symp. Computational Geometry. 1998;96-105.
5. Belleville P., Keil M., McAllister M., Snoeyink J. On computing edges that are in all minimum weight triangulations. Proc. 12th ACM Symp. Computational Geometry. 1996;V7-V8.
6. Bose P., Devroye L., Evans W. Diamonds are not a minimum weight triangulation's best friend. Proc. 8th Canadian Conference on Computational Geometry. 1996;68-73.
7. Cheng S.-W., Katoh N., Sugai M. A study of the LMT-skeleton. Proc. 7th Int. Symp. Algorithms and Computation. Lecture Notes in Computer Science. 1178:1996;256-265 Springer, Berlin.
8. Cheng S.-W., Golin M., Tsang J. Expected case analysis of beta -skeletons with applications to the construction of minimum weight triangulations. Proc. 7th Canadian Conference on Computational Geometry. 1995;279-284.
9. Cheng S.-W., Xu Y.-F. Approaching the largest β -skeleton within the minimum weight triangulation. Proc. 12th ACM Symp. Computational Geometry. 1996;196-203.
10. Dickerson M.T., Keil J.M., Montague M.H. A large subgraph of the minimum weight triangulation. Discrete Comput. Geom. 18:1997;289-304.
11. Dickerson M.T., Montague M.H. A (usually?) connected subgraph of the minimum weight triangulation. Proc. 12th ACM Symp. Computational Geometry. 1996;204-213.
12. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
13. P.D. Gilbert, New results on planar triangulations, M.Sc. thesis, Report R-850, University of Illinois, 1979.
14. Hainz R., Aichholzer O., Aurenhammer F. New results on minimum weight triangulations and the LMT-skeleton. Proc. 13th European Workshop on Computational Geometry. 1997.
15. Heath L.S., Pemmaraju S.V. New results for the minimum weight triangulation problem. Algorithmica. 12:1994;533-552.
16. Keil J.M. Computing a subgraph of the minimum weight triangulation. Computational Geometry. 4:1994;13-26.
17. Kirkpatrick D.G., Radke J.D. A framework for computational morphology. Toussaint G.T. Computational Geometry. 1985;217-248 Elsevier, Amsterdam.
18. Klincsek G.T. Minimal triangulations of polygonal domains. Discrete Math. 9:1980;121-123.
19. Kyoda Y., Imai K., Takeuchi F., Tajima A. A branch-and-cut approach for minimum weight triangulation. Proc. 8th Int. Symp. Algorithms and Computation. Lecture Notes in Computer Science. 1350:1997;384-393 Springer, Berlin.
20. Levcopoulos C., Krznaric D. Quasi-greedy triangulations approximating the minimum weight triangulation. J. Algorithms. 27:1998;303-338.
21. Lingas A. A new heuristic for the minimum weight triangulation. SIAM J. Algebraic Discrete Methods. 8:1987;646-658.
22. Lloyd E.L. On triangulations of a set of points in the plane. Proc. 18th IEEE Symp. Foundations of Computer Science. 1977;228-240.
23. Meijeri H., Rappaport D. Computing the minimum weight triangulation of a set of linearly ordered points. Inform. Process. Lett. 42:1993;35-38.
24. Plaisted D.A., Hong J. A heuristic triangulation algorithm. J. Algorithms. 8:1987;405-437.
25. Shamos M.I., Hoey D. Closest-point problems. Proc. 16th IEEE Symp. Foundations of Computer Science. 1975;151-162.
26. Tajima A., Imai H. Computational investigations of the Optimality of two and three dimensional triangulations under several criteria. Proc. 10th Canadian Conference on Computational Geometry. 1998.
27. Wang C., Chin F., Xu Y. A new subgraph of minimum weight triangulations. J. Combin. Optim. 1:1997;115-127.
28. Wang C., Xu Y. Minimum weight triangulations with convex layers constraint. J. Global Optim. 15:1999;73-83.
29. Wang C., Yang B. A tight bound for β -skeleton of minimum weight triangulations. Proc. 6th International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science. 1663:1999;265-275 Springer, Berlin.
30. Yang B. A better subgraph of the minimum weight triangulation. Inform. Process. Lett. 56:1995;255-258.
31. Yang B., Xu Y., You Z. A chain decomposition algorithm for the proof of a property on minimum weight triangulations. Proc. 5th Int. Symp. Algorithms and Computation. Lecture Notes in Computer Science. 834:1994;423-427 Springer, Berlin.