Triangulations intersect nicely

Discrete and Computational Geometry

Volumn 16, Issue 4, 1996, Pages 339-359

  Aichholzer, O ^a   Aurenhammer, F ^a   Cheng, Siu Wing ^b   Katoh, N ^c   Rote, G ^a   Taschwer, M ^a   Xu, Yin Feng ^d  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

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

^c UNIVERSITY OF HYOGO   (Japan)

^d XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040521319     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02712872     Document Type: Article

References (24)

1. O. Aichholzer, F. Aurenhammer, G. Rote, and M. Taschwer, Triangulations intersect nicely, Proc. 11th Ann. Symp. on Computational Geometry, Vancouver, British Columbia, June 1995, pp. 220-229.
2. O. Aichholzer, F. Aurenhammer, G. Rote, and Y.-F. Xu, New greedy triangulation algorithms, in preparation.
3. B. Bollobás, Graph Theory. An Introductory Course, Springer-Verlag, Berlin, 1979.
4. R. A. Brualdi, Comments on bases in dependence structures, Bull. Austral. Math. Soc. 1 (1969), 161-167
5. T. H. Brylawski, Some properties of basic families of subsets, Discrete Math. 6 (1973), 333-341.
6. S.-W. Cheng and Y.-F. Xu, Constrained independence system and triangulations of planar point sets, in: D.-Z. Du and Ming Li, (eds.), Computing and Combinatorics, Proc. First Ann. Internat. Conf., COCOON'95, Xi'an, China, August 1995. Lecture Notes in Computer Science, Vol. 959, Spinger-Verlag, Berlin, 1995, pp. 41-50.
7. S.-W. Cheng and Y.-F. Xu, Approaching the largest β-skeleton within a minimum-weight triangulation, Proc. 12th Ann. Symp. on Computational Geometry, Philadelphia, PA, 1996, pp. 196-203.
8. G. Das and D. Joseph, Which triangulations approximate the complete graph, Proc Internat. Symp. on Optimal Algorithms, Lecture Notes in Computer Science, Vol. 401, Springer-Verlag, Berlin, 1989, pp. 168-192.
9. M. Dickerson, R. L. Drysdale, S. McElfresh, and E. Welzl, Fast greedy triangulation algorithms. Proc. 10th Ann. Symp. on Computational Geometry, 1994, pp. 211-220.
10. M. Dickerson, R. L. Drysdale, and J.-R. Sack, Simple algorithms for enumerting interpoint distances and finding k nearest neighbors, Internat. J. Comput. Geom. Appl. 3 (1992), 221-239.
11. M. T. Dickerson and M. H. Montague, A (usually?) connected subraph of the minimum weight triangulation, Proc. 12th Ann. Symp. on Computational Geometry, Philadelphia, PA, 1996, pp. 204-213.
12. R. L. Drysdale, G. Rote, and O. Aichholzer, A simple linear time greedy triangulation algorithm for uniformly distributed points, Report IIG-408, Institutes for Information Processing, Technische Universität Graz, February 1995, 16 pages.
13. M. Garey and D. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
14. S. Goldman, A space efficient greedy triangulation algorithm, Inform. Process. Lett. 31 (1989), 191-196.
15. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput. 2 (1973), 225-231.
16. F. Hurtado, M. Noy and J. Urrutia, Flipping edges in triangulations, Proc. 12th Ann. Symp. on Computational Geometry, Philadelphia, PA, 1996, pp. 214-223.
17. M. Keil, Computing a subgraph of the minimum weight triangulation, Comput. Geom. Theory Appl. 4 (1994), 13-26.
18. E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, New York, 1976.
19. C. Levcopoulos and D. Krznaric, The greedy triangulation can be computed from the Delaunay in linear time, Tech. Report LU-CS-TR:94-136, Dept. of Computer Science and Numer. Analysis, Lund University, Lund, Sweden, 1994.
20. C. Levcopoulos and D. Krznaric, Quasi-greedy triangulations approximating the minimum weight triangulation, Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 1996, pp. 392-401.
21. R. E. Tarjan, Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1987
22. Y.-F. Xu, Minimum weight triangulation problem of a planar point set, Ph.D. Thesis, Institute of Applied Mathematics, Academia Sinica, Beijing, 1992.
23. B.-T. Yang Y.-F. Xu, and Z.-Y. You, A chain decomposition algorithm for the proof of a property on minimum weight triangulations, Proc. 5th Internat. Symp. on Algorithms and Computation (ISAAC '94), Lecture Notes in Computer Science, Vol. 834, Springer-Verlag, Berlin, 1994, pp. 423-427.
24. P. Yoeli, Compilation of data for computer-assisted relief cartography, in: J. C. Davis and M. J. McCullagh (eds.), Display and Analysis of Spatial Data, Wiley, New York, 1975, pp. 352-367.