Some of the material in is restricted to members of the community. By logging in, you may be able to gain additional access to certain collections or items. If you have questions about access or logging in, please use the form on the Contact Page.
Estimating normals for 3D point clouds and reconstructing a surface interpolating the points are important problems in Computational Geometry and Computer Graphics. Massive point clouds and surfaces with sharp features are active areas of research for these problems. This thesis provides a fast and accurate algorithm for normal estimation and surface reconstruction which can handle large datasets as well as sharp edges and corners. We were successfully able to compute accurate normals for all the points on a cube including corners and edges and reconstruct the cube. We use several techniques to make the implementation fast and external-memory efficient. The implementation uses multiple threads operating in parallel and hence performs faster on a multiprocessor system. We use a technique called fast projective clustering for fitting multiple planes through the neighborhood of a point. We use a sliding window type streaming algorithm that uses a dynamic data structure for nearest neighbor search. We also develop a simplification algorithm that handles large datasets with sharp edges and corners and enables us to render these datasets using in-core rendering softwares.
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). The copyright in theses and dissertations completed at Florida State University is held by the students who author them.