Ponencia
Finding planar regions in a terrain
Autor/es | Funke, Stefan
Malamatos, Theocharis Ray, Rahul |
Fecha de publicación | 2004 |
Fecha de depósito | 2017-03-02 |
Publicado en |
|
Resumen | We consider the problem of computing large connected regions in a triangulated terrain of size n for which the normals of the triangles deviate by at most some small fixed angle. In previous work an exact near-quadratic ... We consider the problem of computing large connected regions in a triangulated terrain of size n for which the normals of the triangles deviate by at most some small fixed angle. In previous work an exact near-quadratic algorithm was presented, but only a heuristic implementation with no guarantee was practicable. We present a new approximation algorithm for the problem which runs in O(n/e2) time and-apart from giving a guarantee on the quality of the produced solution-has been implemented and shows good performance on real data sets representing fracture surfaces with around half a million triangles. |
Cita | Funke, S., Malamatos, T. y Ray, R. (2004). Finding planar regions in a terrain. En 20th European Workshop on Computational Geometry, Sevilla. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Finding planar regions in a ... | 184.0Kb | [PDF] | Ver/ | |