A New Method of Expressing Point Model Based on Kd-Tree for Plane Area

Article Preview

Abstract:

According to the space equal features of midpoint segmentation KD-tree, anisotropic quantitative method is proposed. After having used this method, the coordinate figures of sampling points in point model were quantified again; and the quantitative results have been represented as encoding of space partition methods and results in the process of constructing KD-tree. Meantime, the effectiveness that the method was used to express point model have been simulated and studied. It turned out that the quantitative method is very suitable for large flat area, because it is not only directly reduce the amount of point model geometry data, but also greatly reduce sampling points in case of keeping the numerical precision of the model geometry data unchanged, so as to further reduce the amount of point model data.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

658-661

Citation:

Online since:

November 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Levoy M., Whitted T. The use of points as a display primitive. Technical Report TR 85-022, University of North Carolina at Chapel Hill, (1985).

Google Scholar

[2] J.P. Grossman, William J. Dally. Point sample rendering. In Proceedings Eurographics Rendering Workshop 98. Eurographics. 1998. 181–192.

DOI: 10.1007/978-3-7091-6453-2_17

Google Scholar

[3] Szymon Rusinkiewicz, Marc Levoy. Qsplat: A multiresolution point rendering system for large meshes. In Proceedings SIGGRAPH 2000. ACM SIGGRAPH. 2000. 343–352.

DOI: 10.1145/344779.344940

Google Scholar

[4] Mario Botsch, Andreas Wiratanaya, Leif Kobbelt. Efficient high quality rendering of point sampled geometry. In Proceedings Eurographics Workshop on Rendering. 2002. 53–64.

Google Scholar

[5] Liu Ren, Hanspeter Pfister, Matthias Zwicker. Object space EWA surface splatting: A hardware accelerated approach to high quality point rendering. Computer Graphics Forum. 2002. 21(3): 461-470.

DOI: 10.1111/1467-8659.00606

Google Scholar

[6] Mario Botsch, Leif Kobbelt. High-quality point-based rendering on modern GPUs. In Proceedings Pacific Graphics 2003, IEEE Computer Society Press. 2003. 335–343.

DOI: 10.1109/pccga.2003.1238275

Google Scholar

[7] Renato Pajarola, Miguel Sainz, Yu Meng. DMesh: Fast depth-image meshing and warping. International Journal of Image and Graphics. 2004. 4(4): 1-29.

DOI: 10.1142/s0219467804001580

Google Scholar

[8] Carsten Dachsbacher, Christian Vogelgsang, Marc Stamminger. Sequential point trees. In Proceedings ACM SIGGRAPH 03. ACM Press. 2003. 657–662.

DOI: 10.1145/1201775.882321

Google Scholar

[9] Hanspeter Pfister, Matthias Zwicker, Jeroen van Baar, Markus Gross. Surfels: Surface elements as rendering primitives. In Proceedings SIGGRAPH 2000. ACM SIGGRAPH, 2000. 335–342.

DOI: 10.1145/344779.344936

Google Scholar