Opened Access Finding planar regions in a terrain
Cites
Show item statistics
Icon
Export to
Author: Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
Date: 2004
Document type: Presentation
Abstract: 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.
Size: 184.0Kb
Format: PDF

URI: http://hdl.handle.net/11441/55074

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)