Computing large planar regions in terrains, with an application to fracture surfaces

Discrete Applied Mathematics

Volumn 139, Issue 1-3, 2004, Pages 253-264

  Smid, Michiel ^a   Ray, Rahul ^b   Wendt, Ulrich ^c   Lange, Katharina ^c  

^a CARLETON UNIVERSITY   (Canada)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Computational geometry; Optimization; Planar region; Terrain

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

PLANAR REGION; TERRAIN;

COMPUTATIONAL GEOMETRY;

EID: 1842736957     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2002.11.004     Document Type: Conference Paper

References (15)

1. P.K. Agarwal, T. Hagerup, R. Ray, M. Sharir, M. Smid, E. Welzl, Translating a planar object to maximize point containment, in: Proceedings of the 10th European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 2461, Springer, Berlin, 2002, pp. 42-53.
2. Agarwal P.K., Suri S. Surface approximation and geometric partitions. SIAM J. Comput. 27:1998;1016-1035.
3. N.M. Amato, M.T. Goodrich, E.A. Ramos, Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling, in: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, USA, 2000, pp. 705-706.
4. Boyde A. Quantitative photogrammetric analysis and qualitative stereoscopic analysis of SEM images. J. Microsc. 98:1973;452-471.
5. Chazelle B., Lee D.T. On a circle placement problem. Computing. 36:1986;1-16.
6. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms. 2nd Edition:2001;MIT Press, Cambridge, MA.
7. de Berg M., van Kreveld M., Overmars M., Schwarzkopf O. Computational Geometry: Algorithms and Applications. 2nd Edition:2000;Springer, Berlin.
8. 2) problems in computational geometry Comput. Geom. Theory Appl. 5:1995;165-185.
9. Harasaki A., Schmit J., Wyant J.C. Improved vertical scanning interferometry. Appl. Opt. 39:2000;2107-2115.
10. J. Holm, K. de Lichtenberg, M. Thorup, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, USA, 1998, pp. 79-89.
11. Mehlhorn K., Näher S. LEDA: A Platform for Combinatorial and Geometric Computing. 1999;Cambridge University Press, Cambridge, UK.
12. Sapidis N.S., Besl P.J. Direct construction of polynomial surfaces from dense range images through region growing. ACM Trans. Graphics. 14:1995;171-200.
13. U.D. Schwarz, Scanning force microscopy, in: S. Amelinckx, D. van Dyck, G. van Landuyt, G. Tendeloo, (Eds.), Handbook of Microscopy, Vol. II, VCH Verlagsgesellschaft, Weinheim, 1997, p. 827.
14. M. Thorup, Near-optimal fully-dynamic graph connectivity, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, Oregon, 2000.
15. Yamaguchi Y., Weldon M.K., Morris M.D. Fractal characterization of SERS-active electrodes using extended focus reflectance microscopy. Appl. Spectrosc. 53:1999;127-132.