Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
A signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Implicit fairing of irregular meshes using diffusion and curvature flow
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Improving the rejection sampling method in quasi-Monte Carlo methods
Journal of Computational and Applied Mathematics
ACM Transactions on Graphics (TOG)
Efficient simplification of point-sampled surfaces
Proceedings of the conference on Visualization '02
Ray Tracing Point Sampled Geometry
Proceedings of the Eurographics Workshop on Rendering Techniques 2000
Fast and Robust Smallest Enclosing Balls
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Ray Tracing Point Set Surfaces
SMI '03 Proceedings of the Shape Modeling International 2003
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
Shape modeling with point-sampled geometry
ACM SIGGRAPH 2003 Papers
Interactive boolean operations on surfel-bounded solids
ACM SIGGRAPH 2003 Papers
Non-iterative, feature-preserving mesh smoothing
ACM SIGGRAPH 2003 Papers
Normal Improvement for Point Rendering
IEEE Computer Graphics and Applications
A survey of point-based techniques in computer graphics
Computers and Graphics
Robust principal axes determination for point-based shapes using least median of squares
Computer-Aided Design
Integral estimation from point cloud in d-dimensional space: a geometric view
Proceedings of the twenty-fifth annual symposium on Computational geometry
Surface area estimation of digitized 3D objects using quasi-Monte Carlo methods
Pattern Recognition
An evaluation of a sketch-based model-by-example approach for crowd modelling
AUIC '12 Proceedings of the Thirteenth Australasian User Interface Conference - Volume 126
k-d Darts: Sampling by k-dimensional flat searches
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |
A novel and efficient quasi-Monte Carlo method for computing the area of a point-sampled surface with associated surface normal for each point is presented. Our method operates directly on the point cloud without any surface reconstruction procedure. Using the Cauchy-Crofton formula, the area of the point-sampled surface is calculated by counting the number of intersection points between the point cloud and a set of uniformly distributed lines generated with low-discrepancy sequences. Based on a clustering technique, we also propose an effective algorithm for computing the intersection points of a line with the point-sampled surface. By testing on a number of point-based models, experiments suggest that our method is more robust and more efficient than those conventional approaches based on surface reconstruction.