Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
On Three-Dimensional Surface Reconstruction Methods
IEEE Transactions on Pattern Analysis and Machine Intelligence
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st 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
Fitting smooth surfaces to dense polygon meshes
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th 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
Displaced subdivision surfaces
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Proceedings of the conference on Visualization '01
Modeling and Rendering for Realistic Facial Animation
Proceedings of the Eurographics Workshop on Rendering Techniques 2000
Subdivision Surface Fitting to a Range of Points
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Optimization methods for scattered data approximation with subdivision surfaces
Graphical Models - Solid modeling theory and applications
Optimization techniques for approximation with subdivision surfaces
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Shrink-Wrapped Isosurface from Cross Sectional Images
IEICE - Transactions on Information and Systems
Chaos & Graphics: A recursive subdivision scheme for isosurface construction
Computers and Graphics
A comparison of sampling strategies for computing general sweeps
Computer-Aided Design
LSM: A layer subdivision method for deformable object matching
Information Sciences: an International Journal
A surface displaced from a manifold
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Personalized animatable avatars from depth data
JVRC '13 Proceedings of the 5th Joint Virtual Reality Conference
| Hi-index | 0.00 |
In this paper we describe the generation of a displaced subdivision surface directly from a set of unorganized points. The displaced subdivision surface is an efficient mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface and has many benefits including compression, rendering, and animation, which overcome limitations of an irregular mesh produced by an ordinary mesh reconstruction scheme. Unlike previous displaced subdivision surface reconstruction methods, our method does not rely on a highly detailed reconstructed mesh. Instead, we efficiently create a coarse base mesh, which is used to sample displacements directly from unorganized points, and this results in a simple process and fast calculation. We suggest a shrink-wrapping-like shape approximation and a point-based mesh simplification method that uses the distance between a set of points and a mesh as an error metric to generate a domain surface that optimally approximates the given points. We avoid time-consuming energy minimization by employing a local subdivision surface fitting scheme. Finally, we show several reconstruction results that demonstrate the usability of our algorithm.