论文信息 - Finding Planar Regions in a Terrain

Finding Planar Regions in a Terrain

We onsider the problem of omputing large onne ted regions in a triangulated terrain of size n for whi h the normals of the triangles deviate by at most some small xed angle. In previous work an exa t near-quadrati algorithm was presented, but only a heuristi implementation with no guarantee was pra ti able. We present a new approximation algorithm for the problem whi h runs in O(n= 2 ) time and|apart from giving a guarantee on the quality of the produ ed solution|has been implemented and shows good performan e on real data sets representing fra ture surfa es with around half a million triangles.

Theocharis Malamatos | Stefan Funke | Rahul Ray

[1] Michiel H. M. Smid,et al. Translating a Planar Object to Maximize Point Containment , 2002, ESA.

[2] David Eppstein,et al. Maintenance of a minimum spanning forest in a dynamic planar graph , 1990, SODA '90.

[3] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[4] Michiel H. M. Smid,et al. Geometric Algorithms for Density-based Data Clustering , 2005, Int. J. Comput. Geom. Appl..

[5] Pankaj K. Agarwal,et al. Exact and Approximation Algortihms for Clustering , 1997 .

[6] Bernard Chazelle,et al. On a circle placement problem , 1986, Computing.

[7] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).