Limit theorems for minimum-weight triangulations, other euclidean functionals, and probabilistic recurrence relations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 252-260

  Golin, Mordecai J ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Euclidean linear functionals; Limit theorems; Minimum weight triangulations

Indexed keywords

TRIANGULATION;

DELAU-NAY TRIANGULATIONS; HIGHER DIMENSIONS; LIMIT THEOREM; LINEAR FUNCTIONALS; MINIMUM WEIGHT TRIANGULATION; RECURRENCE EQUATION; RECURRENCE RELATIONS; UNIFORM DISTRIBUTION;

SURVEYING;

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

References (17)

1. J. Beardwood, J.H. Halton, and J.H. Hammersley, "The Shortest Path Through Many Points," Proceedings of the Camb. Philo. Society, 55 (1959) 299-327.
2. R. C. Chang and R.C.T. Lee, "On the Average Length of Delaunay Triangulations," BIT, 24 (1984) 269-273.
3. Robert L. Scott Drysdale, Gunter Rote, and Osnin Aichhlozer, "A Simple Linear Time Greedy Triangulation Algorithm for Uniformly Distributed Points," Manuscript, (1995).
4. Siu Wing Cheng, Mordecai J. Golin, and Tsang Chiu Fai, Jeffrey, "Expected Case Analysis of Beta-Skeletons with Applications to the Construction of Minimum-weight Triangulations," Manuscript, (1995)
5. G. R. Grimmett and D.R. Stirzaker, Probability and Random Processes (2nd ed.), Clarendon Press - Oxford, Oxford. (1992).
6. Torben Hagerup and Christine Rub, "A Guided Tour of Chemoff Bounds," Information Processing Letters, 33 (1989/90) 305-308.
7. R. M. Karp, "Probabilistic Analysis of Partitioning Algorithms for the Travelling Salesman Problem in the Plane.," Math. Oper. Res., 2 (1977) 209-224.
8. Karp, R.M. and Steele, J.M. "Probabilistic Analysis of Heuristics," in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B., ed.'s,) John Wiley and Sons, New York. 1985
9. R. M. Karp, "Probabilistic Recurrence Relations," The 23rd ACM Symposium on the Theory of Computing, (1991) 190-197.
10. C. Levcopoulos and A. Lingas, "Greedy Triangulation Approximates the Minimum Weight Triangulation in the Average Case and Can be Computed in Linear Time in the Average Case," Proceedings of the 3rd ICCI, Springer-Verlag Lecture Notes in C.S. 497, (1991), 139-148.
11. A. Lingas, "The Greedy and Delaunay Triangulations are not Bad in the Average Case," Information Processing Letters, 22 (1986) 25-31.
12. A. Renyi and R. Sulanke, "Ueber die konvexe hulle von n zufallig gewahlten punkten, I," Z. Wahrschien, 2 (1963) 75-84.
13. T. L. Snyder and J. M. Steele, "Probabilistic Networks and Network Algorithms," Chapter 6 in the Handbook of Operations Research and Management Science: Networks, (eds. M. Ball, T. Magnanti, and C. Monma), (1995).
14. J. M. Steele, "Subadditive Linear Functionals and Nonlinear Growth in Geometric Probability," The Annals of Probability, 9 (1981) 365-376.
15. J. M. Steele, "Optimal Triangulation of Random Samples in the Plane," The Annals of Probability, 10 (1982) 548-553.
16. J. M. Steele, L. A. Shepp, and W. F. Eddy, "On the Number of Leaves of A Euclidean Minimal Spanning Tree," J. Applied Probability, 24 (1987) 806-829.
17. J. M. Steele, "Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space," Mathematics of Operation Research, 15(4) (November 1990) 749-770.