Finding planar regions in a terrain - In practice and with a guarantee

International Journal of Computational Geometry and Applications

Volumn 15, Issue 4, 2005, Pages 379-401

  Funke, Stefan ^a,b   Malamatos, Theocharis ^a   Ray, Rahul ^a,c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Stanford University   (United States)

^c Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

Approximation algorithms; Placement; Planarity; Terrain

Indexed keywords

EID: 24044441608     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195905001750     Document Type: Conference Paper

References (15)

1. M. Smid, R. Ray, U. Wendt and K. Lange, Computing large planar regions in terrains, with an application to fracture surfaces, Discrete Appl. Math. 139 (2004) 253-264.
2. U. Wendt, K. Lange, M. Smid, R. Ray and K. Tönnies, Surface topography quantification by integral and feature-related parameters, Materialwissenschaft und Werkstofftechnik 33 (2002) 621-627.
3. D. P. Huttenlocher and S. Ullman, Object recognition using alignment, in Proc. 1st Int. Conf. Comput. Vision (1987), pp. 102-111.
4. P. K. Agarwal, T. Hagerup, R. Ray, M. Sharir, M. Smid and E. Welzl, Translating a planar object to maximize point containment, in Proc. 10th Ann. European Symp. Algorithms, Lecture Notes Computer Science (Springer-Verlag, 2002), pp. 42-53.
5. S. Har-Peled and S. Mazumdar, Fast algorithms for computing the smallest k-enclosing disc, in Proc. 11th Ann. European Symp. Algorithms, Lecture Notes Computer Science (Springer-Verlag, 2003), pp. 278-288.
6. D. Chen, M. Smid and B. Xu, Geometric algorithms for density-based data clustering, in Proc. 10th Ann. European Symp. Algorithms, Lecture Notes Computer Science (Springer-Verlag, 2002), pp. 284-296.
7. P. K. Agarwal and C. M. Procopiuc, Exact and approximation algorithms for clustering, Algorithmica 33 (2002) 201-226.
8. M. Thorup, Near-optimal fully-dynamic graph connectivity, in Proc. 32th Ann. ACM Symp. Theory Comput. (2000) pp. 343-350.
9. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. R. Westbrook and M. Yung, Maintenance of a minimum spanning forest in a dynamic planar graph, J. Algorith. 13 (1992) 33-54.
10. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. R. Westbrook and M. Yung, Maintenance of a minimum spanning forest in a dynamic planar graph, J. Algorith. 15 (1993) 173.
11. M. L. Fredman, J. Komlos and E. Szemeredi, Storing a sparse table with O(1) worst case access time, J. ACM 31 (1984) 538-544.
12. B. M. Chazelle and D. T. Lee, On a circle placement problem, Computing 36 (1986) 1-16.
13. S. Arya, T. Malamatos and D. M. Mount, Space-time tradeoffs for approximate spherical range counting, in Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms (2005), pp. 535-544.
14. K. Mehlhorn and S. Näher, LEDA: A Platform for Combinatorial and Geometric Computing (Cambridge University Press, Cambridge, U.K., 1999).
15. N. Amenta, S. Levy, T. Munzner and M. Philips, Geomview: A system for geometric visualization, in Proc. 11th Ann. ACM Symp. Comput. Geom. (1995) pp. C12-C13.