Abstract
This paper touches upon the problem of a compact polygonal description of objects. A method of lossless compression of geometric data based on perturbation functions is proposed. Advantages of this approach over the known algorithms of transformation of three-dimensional models for fast transmission of information and its compact storage are demonstrated.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
J. Rossignac and A. Szymczak, “Wrap&zip: Linear Decoding of Planar Triangle Graphs,” Computat. Geometry: Theory and Appl. 14 (1–3), 119–135 (1999).
J. Rossignac, “Edgebreaker: Connectivity Compression for Triangle Meshes,” IEEE Trans. Vis. Comput. Graph. 5 (1), 47–61 (1999). DOI: https://doi.org/10.1109/2945.764870.
C. Touma and C. Gotsman, “Triangle Mesh Compression,” in Proc. of the Conf. on Graphics Interface’98, Vancouver, Canada, June 18–20, 1998, pp. 26–34. DOI: https://doi.org/10.20380/GI1998.04.
M. Deering, “Geometry Compression,” in Proc. of the Conf. SIGGRAPH’95, Los Angeles, USA, August 6–11, 1995, pp. 13–20. DOI: https://doi.org/10.1145/218380.218391.
M. Isenburg and J. Snoeyink, “Mesh Collapse Compression,” in Proc. of the 15th Annual Symp. Computational Geometry (SCG’99), Miami Beach, USA, June 13–16, 1999, pp. 419–420. DOI: https://doi.org/10.1145/304893.305000.
R. Pajarola, J. Rossignac, and A. Szymczak, “Implant Sprays: Compression of Progressive Tetrahedral Mesh Connectivity,” in Proc. of the IEEE Conf. on Visualization’99, San Francisco, USA, October 24–29, 1999, pp. 299–306.
R. Pajarola and J. Rossignac, “Compressed Progressive Meshes,” IEEE Trans. Vis. Comput. Graph. 6 (1), 79–93 (2000). DOI: https://doi.org/10.1109/2945.841122.
R. Pajarola and J. Rossignac, “Squeeze: Fast and Progressive Decompression of Triangle Meshes,” in Proc. of the Computer Graphics Intern. Conf. (CGI’2000), Geneva, Switzerland, June 19–24, 2000, pp. 173–182.
E. Derzapf and M. Guthe, “Dependency-Free Parallel Progressive Meshes,” Comput. Graph. Forum 31 (8), 2288–2302 (2012).
F. Caillaud, V. Vidal, F. Dupont, and G. Lavou´e, “Progressive Compression of Arbitrary Textured Meshes,” Comput. Graph. Forum 35 (7), 475–484 (2016).
G. Yngve and G. Turk, “Robust Creation of Implicit Surfaces from Polygonal Meshes,” IEEE Trans. Vis. Comput. Graph. 8 (4), 346–359 (2002).
C. Shen, J. F. O’Brien, and J. R. Shewchuk, “Interpolating and Approximating Implicit Surfaces from Polygon Soup,” in Proc. of the 31th Intern. Conf. ACM SIGGRAPH, Los Angeles, USA, August 8–12, 2004, pp. 896–904.
Y. Ohtake, A. Belyaev, M. Alexa, and H.-P. Seidel, “Multi-Level Partition of Unity Implicits,” Proc. ACM Trans. Graph. 22 (3), 463–470 (2003).
S. I. Vyatkin, “Complex Surface Modeling Using Perturbation Functions,” Avtometriya 43 (3), 40–47 (2007) [Optoelectron., Instrum. Data Process. 43 (3), 226–231 (2007)].
S. I. Vyatkin, “Transformations of Functionally Defined Forms,” Progr. Sist. Vych. Metody 9 (4), 484–499 (2014).
J. Bloomenthal, C. Bajaj, J. Blinn, et al., Introduction to Implicit Surfaces (Morgan Kaufmann Publishers, San Francisco, 1997).
S. I. Vyatkin, “Polygonization Method for Functionally Defined Objects,” Intern. J. Automat., Control Intell. Syst. 1 (1), 1–8 (2015).
S. I. Vyatkin, “Recursive Search Method for the Image Elements of Functionally Defined Surfaces,” Avtometriya 53 (3), 53–57 (2017) [Optoelectron., Instrum. Data Process. 53 (3), 245–249 (2017)].
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © S.I. Vyatkin, B.S. Dolgovesov, 2018, published in Avtometriya, 2018, Vol. 54, No. 4, pp. 18–25.
About this article
Cite this article
Vyatkin, S.I., Dolgovesov, B.S. Compression of Geometric Data with the Use of Perturbation Functions. Optoelectron.Instrument.Proc. 54, 334–339 (2018). https://doi.org/10.3103/S8756699018040039
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S8756699018040039