A study of the LMT-skeleton

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1178, Issue , 1996, Pages 256-265

  Cheng, Siu Wing ^a   Katoh, Naoki ^b   Sugai, Manabu ^b  

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

^b UNIVERSITY OF HYOGO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

TRIANGULATION;

MINIMALITY; MINIMUM WEIGHT TRIANGULATION; ONE-PASS; POINT SET; SPACE REDUCTIONS; SUBGRAPHS;

MUSCULOSKELETAL SYSTEM;

EID: 84990205927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009502     Document Type: Conference Paper

References (12)

1. A. Aggarwal, M.M. Klawe, S. Moran, P.W. Shor, and R. Wilber: Geometric applications of a matrix-searching algorithm, Algorithmica, 2 (1987), pp. 195-208.
2. O. Aichholzer, F. Aurenhammer, S.W. Cheng, N. Katoh, G. Rote, M. Taschwer, and Y.F. Xu, Triangulations intersect nicely, manuscript, 1996.
3. P. BeUeville, M. Keil, M. McAUister, and J. Snoeyink, On computing edges that are in all minimum-weight triangulations, Video Presentation, Syrup. Computational Geometry, 1996.
4. P. Bose, L. Devroye, and W. Evans, Diamonds are not a minimum weight triangulation's best friend, Proceedings of Canadian Conference on Computational Geometry, 1996. See also technical report 96-01, Dept. of Computer Science, Univ. of British Columbia, January 1996.
5. S.W. Cheng and Y.F. Xu, Approaching the largest β-skelcton within a minimum weight triangulation, Proc. Syrup. Computational Geometry, 1996, pp. 196-203.
6. M.T. Dickerson and M.H. Montague, A (usually?) connected subgraph of minimum weight triangulation, Proc. Syrup. Computational Geometry, 1996, pp. 204-213.
7. M. Golin, Limit theorems for minimum-weight triangulations, other Euclidean functionals, and probabilistie recurrence relations, Proc. Syrup. Discrete Algorithms, 1996, pp. 252-260.
8. L. Heath and S.V Pemmaraju, New results for the minimum weight triangulation problem, Algorithmica, 12 (1994), pp. 533-552.
9. J.M. Keil, Computing a subgraph of the minimum weight triangulation, Computational Geometry: Theory and Applications, 4 (1994), pp. 13-26.
10. C. Levcopoulos and D. Krznaric, Quasi-greedy triangulations approximating the minimum weight triangulation, Proc. Syrup. Discrete Algorithms, 1996, pp. 392-401.
11. C. Levcopoulos and D. Krznaric, A fast heuristic for approximating the minimum weight triangulation, Proc. Scandinavian Workshop on Algorithmic Theory, 1996.
12. B. Yang, Y. Xu, and Z. You, A chain decomposition algorithm for the proof of a properly on minimum weight triangulation, in Proc. International Symposium on Algorithms and Computation, 1994, pp. 423-427.