Diamonds are not a minimum weight triangulation's best friend

International Journal of Computational Geometry and Applications

Volumn 12, Issue 6, 2002, Pages 445-453

  Bose, Prosenjit ^a   Devroye, Luc ^b   Evans, William ^c  

^a CARLETON UNIVERSITY   (Canada)

^b MCGILL UNIVERSITY   (Canada)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Computational geometry; Light edges; Locally minimal triangulations; Minimum weight triangulations; Probabilistic analysis

Indexed keywords

EID: 0036972011     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195902000979     Document Type: Article

References (16)

1. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
2. J. M. Keil, Computing a subgraph of the minimum weight triangulation, Computational Geometry: Theory and Applications 4 (1994) 13-26.
3. D. Kirkpatrick and J. Radke, A framework for computational morphology, Computational Geometry, ed. G. T. Toussaint (1985) 217-248.
4. P. N. Gilbert, New results in planar triangulations, M.Sc. Thesis, Coordinated Science Laboratory, University of Illinois, Urbana, IL, (1979).
5. G. Klincsek, Minimal triangulations of polygonal domains, Annals of Discrete Mathematics, 9 (1980) 121-123.
6. S. Cheng, M. Golin, and J. Tsang, Expected case analysis of β-skeletons with applications to the construction of minimum-weight triangulations, Proceedings of the Seventh Canadian Conference on Computational Geometry (1995).
7. B. Yang, Y. Xu, and Z. You, A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations, Proceedings of the International Symposium on Algorithms and Complexity, LNCS 834, Springer-Verlag, (1994) 423-427.
8. S. Cheng and Y. Xu, Approaching the largest β-skeleton within a minimum weight triangulation, Proceedings of the 12th Annual ACM Symposium on Computational Geometry, (1996) 196-203.
9. O. Aichholzer, F. Aurenhammer, M. Taschwer and G. Rote, Triangulations intersect nicely, Proceedings of the 11th Annual ACM Symposium on Computational Geometry, 220-229 (1995).
10. J. M. Keil, Personal communication, (1995).
11. M. T. Dickerson and M. H. Montague, A (usually?) connected subgraph of the minimum weight triangulation, Proceedings of the 12th Annual ACM Symposium on Computational Geometry, 204-213 (1996).
12. C. McDiarmid, On the method of bounded differences, in Surveys in Combinatorics 1989, 141 London Mathematical Society Lecture Notes Series, Cambridge University Press, Cambridge, (1989) 148-188.
13. W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association, 58 (1963) 13-30.
14. K. Azuma, Weighted sums of certain dependent random variables, Tohoku Mathematical Journal, 37 (1967) 357-367.
15. W. F. Stout, Almost Sure Convergence, Academic Press, New York, 1974.
16. G. R. Grimmett and D. R. Stirzaker, Probability and Random Processes, Oxford University Press, 1992.