A new subgraph of minimum weight triangulations

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

Volumn 1178, Issue , 1996, Pages 256-265

  Wang, Cao An ^a   Chin, Francis ^b   Xu, Yin Feng ^c  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; TRIANGULATION;

GEOMETRIC PROPERTIES; LOCAL OPTIMAL; MINIMUM WEIGHT TRIANGULATION; PLANAR POINT SETS; POINT SET; SUBGRAPHS; TIME ALGORITHMS;

SURVEYING;

EID: 84990181912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. O. Aichholzer, F. Auronhammer, G. Rotes and M. Tachwer, Triangulations intersect nicely, Proc. 11th Ann. Syrup. on Computational Geometry, Vancouver, B.C., Association for Computing Machinery, pp. 220-229, 1995.
2. E. Anaguostou and D. Comeil, Polynomial time instances of the minimum weight triangulation problem, Computational Geometry: Theory and applications, vol. 3, pp. 247-259, 1993.
3. S.-W. Cheng, M. Golin and J. Tsang, Expected case analysis of b-skeletons with applications to the construction of minimum weight triangulations, CCCG Conference Proceedings, P.Q., Canada, pp. 279-284,1995.
4. S.-W. Cheng and Y.-F. Xu, Constrained independence system and triangulations of planar point sets, in: D.-Z. DU, Ming Li, (eds.), Computing and Combinatorics, Proc. First Ann. Int. Conf., COCOON’95, LNCS 959, Springer-Verlag, pp. 41-50, 1995.
5. S.-W. Cheng and Y.-F. Xu, Approaching the largest β-skeieton within the minimum weight triangulation, Proc. 12th Ann. Syrup. Computational Geometry, Philadelphia, Association for Computing Machinery, 1996.
6. M.T. Dickerson, M.H. Montague, The exact minimum weight triangulation, Proc. 12th Ann. Syrup. Computational Geometry., Philadelphia, Association for Computing Machinery, 1996.
7. P.D. Gilbert, New results in planar triangulations, TR.-850, University of Illinois Coordinated science Lab, 1979.
8. M. Garey and D. Johnson, Computer and Intractability. A guide to the theory of NPcompleteness, Freeman, 1979.
9. L. Heath and S. Pemmarajiu, New results for the minimum weight triangulation problem, Virginia Polytechnic Institute and State University, Dept. of Computer Science s TR 92-30, 1992.
10. J.M. Keil, Computing a subgraph of the minimum weight triangulation, Computational Geometry: Theory and Applications pp. 13-26, 4 (1994).
11. G. Klinesek, Minimal triangulations of polygonal domains, Ann. Discrete Math., pp. 121-123, 9 (1980).
12. A. Lingas, A new heuristic for the minimum weight triangulation, SIAM Journal of Algebraic and Discrete Methods, pp. 4-658, 8(1987).
13. H. Meijer and D. Rappaport, Computing the minimum weight triangulation of a set of linearly ordered points, Information Processing Letters vol. 42, pp. 35-38, 1992.
14. A. Mirzain, C. Wang and Y. Xu, On stable The segments in trepanations, Proceedings of 8th CCCG, Ottawa, 1996, pp.68-73.
15. Y. Xu, D. Zhou, Improved heuristics for the m]nlmum weight triangulation, Acta Mathematics Applicatae Sinica, vol. 11, no. 4, pp. 359-368, 1995.
16. B. Yang, Y. Xu and Z. You, A chain decomposition algorithm for the proof of a property on minimum weight triangulations, Proc. 5th International Symposium on Algorithms and Computation (ISAAC'94), LNCS 834, Springer-Verlag, pp. 423-427, 1994.