Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Anisotropic mesh transformations and optimal error control
Proceedings of the third ARO workshop on Adaptive methods for partial differential equations
The approximation power of moving least-squares
Mathematics of Computation
A flow-guided streamline seeding strategy
Proceedings of the conference on Visualization '00
Are Bilinear Quadrilaterals Better Than Linear Triangles?
SIAM Journal on Scientific Computing
Proceedings of the conference on Visualization '01
The Topology of Symmetric, Second-Order 3D Tensor Fields
IEEE Transactions on Visualization and Computer Graphics
Computing and Rendering Point Set Surfaces
IEEE Transactions on Visualization and Computer Graphics
Anisotropic polygonal remeshing
ACM SIGGRAPH 2003 Papers
Global conformal surface parameterization
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
The topology of symmetric, second-order tensor fields
VIS '94 Proceedings of the conference on Visualization '94
Direct Anisotropic Quad-Dominant Remeshing
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
Periodic global parameterization
ACM Transactions on Graphics (TOG)
Robust Smooth Feature Extraction from Point Clouds
SMI '07 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007
Extracting lines of curvature from noisy point clouds
Computer-Aided Design
ACM SIGGRAPH 2009 papers
Global parametrization of range image sets
Proceedings of the 2011 SIGGRAPH Asia Conference
Normal estimation for point clouds: a comparison study for a Voronoi based method
SPBG'05 Proceedings of the Second Eurographics / IEEE VGTC conference on Point-Based Graphics
| Hi-index | 0.00 |
To perform quad meshing on raw point clouds, existing algorithms usually require a time-consuming parameterization or Voronoi space partition process. In this paper, we propose an effective method to generate quad-dominant meshes directly from unorganized point clouds. In the proposed method, we first apply Marinov's curvature tensor optimization to the input point cloud to reduce the umbilical regions in order to obtain a smooth curvature tensor. We then propose an efficient marching scheme to extract the curvature lines with controllable density from the point cloud. Finally, we apply a specialized K-Dimension (KD) tree structure, which converts the nearest neighbor searching problem into a sorting problem, to efficiently estimate the intersections of curvature lines and recover the topology of the quad-dominant meshes. We have tested the proposed method on different point clouds. Our results show that the proposed method produces good quality meshes with high computational efficiency and low memory requirement.