Zhiying He
ABSTRACT
The simplification of point models is important in point-based processing technology because of the increasing of data complexity. Many researches focus on getting the subset from the initial point set, which can not represent the whole object properly. In this paper, we present a novel simplification algorithm based on Moving Least Square (MLS) and Splats for point models. The algorithm uses MLS to represent the point models and can get the minimum error point which is used to deputize its neighborhood. This approach can get new proper agent points instead of subset. Then we calculate the error based on the rendering results, which means considering the geometry of splat when calculating the error of simplification. Experiment results show that this algorithm is not only efficient, but also has good quality.
Supplemental Material
- {AA04} Alexa M., Adamson A.: On normals and projection operators for surfaces defined by point sets. In Proc. of Symp. on Point-Based Graphics 04. pp. 149--155. 2004. Google Scholar
Digital Library
- {ABC*01} Alexa M., Behr J., Cohen-Or D., Fleishman S., Levin D., Silva C. T.: Point set surfaces. In Proc. of the conference on (IEEE) Visualization 01. pp. 21--28. 2001 Google ScholarDigital Library
- {ABC*03} Alexa M., Behr J., Cohen-Or D., Fleishman S., Levin D., Silva C. T.: Computing and rendering point set surfaces. IEEE Transactions on Visualization and Computer Graphics 9 (1), 3--15. 2003. Google ScholarDigital Library
- {AK04} Amenta N., Kil Y.: Defining point-set surfaces. ACM Trans. Graph. 23, 3 (2004), 264--270. 2004. Google ScholarDigital Library
- {GG07} Guennebaud G., Gross M.: Algebraic Point Set Surfaces. In Proc. of ACM SIGGRAPH 2007. 2007. Google ScholarDigital Library
- {KV03} Kalaiah A., Varshney A.: Statistical point geometry. In Eurographics Symposium on Geometry Processing (2003), pp. 107--115. 2003. Google ScholarDigital Library
- {L03} Levin D.: Mesh-independent surface interpolation. In Geometric Modeling for Scientific Visualization (2003), pp. 37--49. 2003.Google Scholar
- {OBS05} Ohtake, Y., Belyaev, A., Seidel, H.-P.: An integrating approach to meshing scattered point data. Proceedings of 9th ACM Symposium on Solid Modeling and Applications, pp. 61--69. 2005. Google ScholarDigital Library
- {PGK02} Pauly M., Gross M., Kobbelt L. P.: Efficient Simplification of Point-Sampled Surfaces. In Proceedings of the conference on Visualization, Boston, Massachusetts, pp. 163--170. 2002. Google ScholarDigital Library
- {RL00} Rusinkiewicz S., Levoy M.: Qsplat: A multiresolution point rendering system fo large meshes. In Proceedings SIGGRAPH 2000, pp. 343--352. 2000. Google ScholarDigital Library
- {WK04} Wu J., Kobbelt L.: Optimized sub-sampling of point sets for surface splitting. In Proc. of Eurographics 2004. 2004.Google Scholar
- {ZPB*01} Zwicker M., Pfister H., Baar J. V., Gross M.: Surface splatting. In Proceedings SIGGRAPH 2001, pp. 371--378. 2001. Google ScholarDigital Library
Index Terms
- A novel simplification algorithm based on MLS and Splats for point models
Recommendations
Mesh simplification algorithm based on n-edge mesh collapse
ICAT'06: Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-ExistenceThis paper presents a method for dividing the triangle mesh into n-edge mesh and puts forward a new mesh simplification algorithm based on n-edge mesh collapse. An n-edge mesh can be in the form of an edge, a triangle or a quadrangle, it depends on the ...
Algebraic Splats Representation for Point Based Models
ICVGIP '08: Proceedings of the 2008 Sixth Indian Conference on Computer Vision, Graphics & Image ProcessingThe primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number of surfels are needed to convey the exact shape. Higher-order ...
Simplification of unstructured tetrahedral meshes by point sampling
VG'05: Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume GraphicsTetrahedral meshes are widely used in scientific computing for representing three-dimensional scalar, vector, and tensor fields. The size and complexity of some of these meshes can limit the performance of many visualization algorithms, making it hard ...
Comments