Π Π°Π·ΡΠ°Π±ΠΎΡΠΊΠ° ΠΈ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΡΠΆΠ°ΡΠΈΡ 3-Ρ ΠΌΠ΅ΡΠ½ΡΡ Π³ΡΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΡ ΠΎΠ±ΡΠ΅ΠΊΡΠΎΠ² Π΄Π»Ρ ΠΊΠΎΠ»Π»Π΅ΠΊΡΠΈΠ²Π½ΠΎΠ³ΠΎ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π² ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½ΡΡ ΡΠ΅ΡΡΡ
ΠΠΎΠ»Π»Π΅ΠΊΡΠΈΠ²Π½Π°Ρ ΡΠ°Π±ΠΎΡΠ° Π½Π°Π΄ ΠΏΡΠΎΠ΅ΠΊΡΠ°ΠΌΠΈ Π² ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½ΠΎΠΉ ΡΠ΅ΡΠΈ ΡΡΠ°Π½ΠΎΠ²ΠΈΡΡΡ ΡΠ΅Π³ΠΎΠ΄Π½Ρ ΠΎΡΠ½ΠΎΠ²Π½ΠΎΠΉ ΡΠ΅Ρ Π½ΠΎΠ»ΠΎΠ³ΠΈΠ΅ΠΉ ΠΈΠ½ΠΆΠ΅Π½Π΅ΡΠ½ΠΎΠ³ΠΎ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π² ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ ΠΏΡΠ΅Π΄ΠΌΠ΅ΡΠ½ΡΡ ΠΎΠ±Π»Π°ΡΡΡΡ . ΠΡΠΈ ΡΡΠΎΠΌ ΡΠΏΠ΅ΡΠΈΡΠΈΠΊΠ° ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ³ΠΎ ΠΎΠ±ΠΌΠ΅Π½Π°, ΡΠ²ΡΠ·Π°Π½Π½ΠΎΠ³ΠΎ Ρ Π΄Π΅ΡΠ°Π»ΠΈΠ·Π°ΡΠΈΠ΅ΠΉ, ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΠΈ ΠΈΠ½ΠΊΠ°ΠΏΡΡΠ»ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΠΌΠ½ΠΎΠ³ΠΎΡΡΠΎΠ²Π½Π΅Π²ΡΡ ΠΏΡΠΎΠ΅ΠΊΡΠ½ΡΡ ΡΠ΅ΡΠ΅Π½ΠΈΠΉ, ΡΡΠ΅Π±ΡΠ΅Ρ Π²ΡΡΠΎΠΊΠΎΠΉ ΡΠ΅Π°ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ ΠΈ Π½Π°Π΄Π΅ΠΆΠ½ΠΎΡΡΠΈ ΡΠΈΡΡΠ΅ΠΌΡ «ΠΊΠ»ΠΈΠ΅Π½Ρ-ΡΠ΅ΡΠ²Π΅Ρ». Π ΡΡΠΎΠΉ ΡΠ²ΡΠ·ΠΈ ΡΠ½ΠΈΠΆΠ΅Π½ΠΈΠ΅ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ… Π§ΠΈΡΠ°ΡΡ Π΅ΡΡ >
- Π‘ΠΎΠ΄Π΅ΡΠΆΠ°Π½ΠΈΠ΅
- ΠΡΠ΄Π΅ΡΠΆΠΊΠ°
- ΠΠΈΡΠ΅ΡΠ°ΡΡΡΠ°
- ΠΡΡΠ³ΠΈΠ΅ ΡΠ°Π±ΠΎΡΡ
- ΠΠΎΠΌΠΎΡΡ Π² Π½Π°ΠΏΠΈΡΠ°Π½ΠΈΠΈ
Π‘ΠΎΠ΄Π΅ΡΠΆΠ°Π½ΠΈΠ΅
- 1. ΠΡΠ°ΡΠΊΠΈΠΉ ΠΎΠ±Π·ΠΎΡ ΡΠΎΡΡΠΎΡΠ½ΠΈΡ Π²ΠΎΠΏΡΠΎΡΠ° ΠΈ ΠΏΠΎΡΡΠ°Π½ΠΎΠ²ΠΊΠ° Π·Π°Π΄Π°Ρ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ
- 1. 1. ΠΠ»Π³ΠΎΡΠΈΡΠΌΡ ΡΠ½ΠΈΠΆΠ΅Π½ΠΈΡ ΡΠΈΡΠ»Π° ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ² ΠΎΠΏΠΈΡΡΠ²Π°ΡΡΠΈΡ ΠΠ-ΠΌΠΎΠ΄Π΅Π»Ρ
- 1. 2. ΠΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΡ ΠΌΠΎΠ΄Π΅Π»ΠΈ Ρ ΡΡΠ΅ΡΠΎΠΌ ΠΏΠ΅ΡΠ΅Π΄Π°ΡΠΈ ΠΏΠΎ ΡΠ΅ΡΠΈ
- 1. 3. ΠΠ°Π΄Π°ΡΠΈ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ
- 2. Π‘ΠΆΠ°ΡΠΈΠ΅ ΠΈΠ½ΠΆΠ΅Π½Π΅ΡΠ½ΡΡ
ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ Ρ ΡΡΠ΅ΡΠΎΠΌ ΡΠΏΠ΅ΡΠΈΡΠΈΠΊΠΈ ΡΠΆΠΈΠΌΠ°Π΅ΠΌΡΡ
Π΄Π°Π½Π½ΡΡ
- 2. 1. Π‘ΠΏΠ΅ΡΠΈΡΠΈΠΊΠ° ΠΈΠ½ΠΆΠ΅Π½Π΅ΡΠ½ΡΡ ΠΠ-ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ
- 2. 2. Π Π°ΡΠΏΠΎΠ·Π½Π°Π²Π°Π½ΠΈΠ΅ ΠΈ ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΠΏΠΎΠ²ΡΠΎΡΡΡΡΠΈΡ ΡΡ ΠΎΠ±ΡΠ΅ΠΊΡΠΎΠ²
- 2. 3. ΠΠ΅ΡΠΎΠ΄ ΡΠΆΠ°ΡΠΈΡ ΠΏΠΎΠ»ΠΈΠ³ΠΎΠ½Π°Π»ΡΠ½ΡΡ ΠΈΠ½ΠΆΠ΅Π½Π΅ΡΠ½ΡΡ ΠΠ-ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ Ρ ΠΏΠΎΠΌΠΎΡΡΡ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΏΠΎΠΈΡΠΊΠ° ΠΏΠ»ΠΎΡΠΊΠΈΡ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ²
- 2. 4. ΠΡΠ²ΠΎΠ΄Ρ ΠΏΠΎ Π³Π»Π°Π²Π΅ 2
- 3. Π Π΅Π°Π»ΠΈΠ·Π°ΡΠΈΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² Π°Π²ΡΠΎΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΏΠΎΠΈΡΠΊΠ° ΠΏΠ»ΠΎΡΠΊΠΈΡ
ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ²
- 3. 1. ΠΠ±ΡΠ°Ρ ΡΡ Π΅ΠΌΠ° Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΠΏΠΎΠΈΡΠΊΠ° ΠΏΠ»ΠΎΡΠΊΠΈΡ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ²
- 3. 2. ΠΠ»Π³ΠΎΡΠΈΡΠΌ ΠΏΠ΅ΡΠ΅Π±ΠΎΡΠ° ΡΠΎΡΠ΅ΡΠ°Π½ΠΈΠΉ
- 3. 3. ΠΠ»Π³ΠΎΡΠΈΡΠΌ ΠΏΠ»ΠΎΡΠΊΠΈΡ
ΡΠ΅ΡΠ΅Π½ΠΈΠΉ
- 3. 3. 1. ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ ΡΠ΅ΡΠ΅Π½ΠΈΠΉ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° Vo Π² Π½Π°ΠΏΡΠ°Π²Π»Π΅Π½ΠΈΠΈ iVj
- 3. 3. 2. ΠΠ΅Π½Π΅ΡΠ°ΡΠΈΡ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ² N Ρ Π·Π°Π΄Π°Π½Π½ΡΠΌ ΠΎΡΠΊΠ»ΠΎΠ½Π΅Π½ΠΈΠ΅ΠΌ ΡΠΎΡΠ΅Π΄Π½ΠΈΡ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ²
- 3. 3. 3. ΠΡΠ΅Π½ΠΊΠ° Π±ΡΡΡΡΠΎΠ΄Π΅ΠΉΡΡΠ²ΠΈΡ ΠΈ ΡΠ΅ΡΡΡΡΠΎΠ΅ΠΌΠΊΠΎΠ΅&trade- Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°
- 3. 4. ΠΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΠ΅ ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ Π½Π°ΠΉΠ΄Π΅Π½Π½ΡΡ
Π³ΡΡΠΏΠΏ
- 3. 4. 1. ΠΡΠ΅Π½ΠΊΠ° ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ Π²Π²Π΅Π΄Π΅Π½ΠΈΡ Π³ΡΡΠΏΠΏΡ
- 3. 4. 2. ΠΠΎΠ΄Π±ΠΎΡ ΠΎΠΏΡΠΈΠΌΠ°Π»ΡΠ½ΠΎΠ³ΠΎ ΡΠΎΡΠ΅ΡΠ°Π½ΠΈΡ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ² V2 Π΄Π»Ρ ΠΌΠ°ΠΊΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠ° ΡΠΆΠ°ΡΠΈΡ
- 3. 5. Π‘Π΅ΡΠ΅Π²Π°Ρ ΠΏΠ΅ΡΠ΅Π΄Π°ΡΠ°
- 3. 5. 1. ΠΠΏΡΠΈΠΌΠΈΠ·ΠΈΡΠΎΠ²Π°Π½Π½Π°Ρ ΠΏΠ΅ΡΠ΅Π΄Π°ΡΠ° Ρ ΠΏΠΎΡΡΠΎΡΠ½Π½ΡΠΌ ΡΡΠΎΠ²Π½Π΅ΠΌ Π΄Π΅ΡΠ°Π»ΠΈΠ·Π°ΡΠΈΠΈ
- 3. 5. 2. ΠΡΠΎΠ³ΡΠ΅ΡΡΠΈΠ²Π½Π°Ρ ΠΏΠ΅ΡΠ΅Π΄Π°ΡΠ° ΠΌΠΎΠ΄Π΅Π»ΠΈ
- 3. 6. ΠΡΠ²ΠΎΠ΄Ρ ΠΏΠΎ Π³Π»Π°Π²Π΅ 3
- 4. ΠΠΊΡΠΏΠ΅ΡΠΈΠΌΠ΅Π½ΡΠ°Π»ΡΠ½ΡΠ΅ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ
- 4. 1. ΠΠ°Π΄Π°ΡΠΈ ΡΠΊΡΠΏΠ΅ΡΠΈΠΌΠ΅Π½ΡΠ°Π»ΡΠ½ΡΡ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠΉ
- 4. 2. Π Π°Π·ΡΠ°Π±ΠΎΡΠ°Π½Π½ΠΎΠ΅ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠ΅ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠ΅Π½ΠΈΠ΅
- 4. 3. ΠΠΊΡΠΏΠ΅ΡΠΈΠΌΠ΅Π½ΡΠ°Π»ΡΠ½ΡΠ΅ ΠΏΠΎΠ΄ΡΠ²Π΅ΡΠΆΠ΄Π΅Π½ΠΈΡ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ ΠΌΠ΅ΡΠΎΠ΄Π° ΡΠΆΠ°ΡΠΈΡ Ρ ΠΏΠΎΠΌΠΎΡΡΡ ΠΏΠΎΠΈΡΠΊΠ° ΠΏΠ»ΠΎΡΠΊΠΈΡ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ²
- 4. 4. ΠΠΊΡΠΏΠ΅ΡΠΈΠΌΠ΅Π½ΡΠ°Π»ΡΠ½ΡΠ΅ Π΄Π°Π½Π½ΡΠ΅ ΠΎ ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄ΠΈΡΠ΅Π»ΡΠ½ΠΎΡΡΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΠΏΠΎΠΈΡΠΊΠ° ΠΏΠ»ΠΎΡΠΊΠΈΡ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ²
- 4. 5. Π Π΅Π·ΡΠ»ΡΡΠ°ΡΡ ΡΠ°Π±ΠΎΡΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΠΏΠ»ΠΎΡΠΊΠΈΡ
ΡΠ΅ΡΠ΅Π½ΠΈΠΉ. Π‘ΡΠ°Π²Π½Π΅Π½ΠΈΠ΅ Π΄Π°Π½Π½ΡΡ
ΠΎ ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ
ΡΠΏΠΎΡΠΎΠ±Π°Ρ
Π³Π΅Π½Π΅ΡΠ°ΡΠΈΠΈ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π°
- 4. 5. 1. ΠΠ½Π°Π»ΠΈΠ· Π·Π°Π²ΠΈΡΠΈΠΌΠΎΡΡΠΈ ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠ° ΡΠΆΠ°ΡΠΈΡ ΠΎΡ ΡΠΈΡΠ»Π° ΠΈΡΠ΅ΡΠ°ΡΠΈΠΉ
- 4. 5. 2. ΠΠ½Π°Π»ΠΈΠ· ΠΠ°Π²ΠΈΡΠΈΠΌΠΎΡΡΠΈ ΡΠΈΡΠ»Π° Π½Π°ΠΉΠ΄Π΅Π½Π½ΡΡ ΠΏΠ»ΠΎΡΠΊΠΈΡ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ² ΠΎΡ ΡΠΈΡΠ»Π° ΠΈΡΠ΅ΡΠ°ΡΠΈΠΉ
- 4. 5. 3. ΠΠ½Π°Π»ΠΈΠ· Π·Π°Π²ΠΈΡΠΈΠΌΠΎΡΡΠΈ ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠ° ΡΠΆΠ°ΡΠΈΡ ΠΎΡ ΡΠΈΡΠ»Π° Π½Π°ΠΉΠ΄Π΅Π½Π½ΡΡ ΠΏΠ»ΠΎΡΠΊΠΈΡ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ²
- 4. 6. ΠΡΠ²ΠΎΠ΄Ρ ΠΏΠΎ Π³Π»Π°Π²Π΅ 4
Π‘ΠΏΠΈΡΠΎΠΊ Π»ΠΈΡΠ΅ΡΠ°ΡΡΡΡ
- Huffman D. A. A method for the construction of minimum redundancy codes. // 1. stitute of Electrical and Radio Engineers 40,9(Sept.). — 1952. — Pp. 1098−1101.
- Langdon G. f Rissanen J. Compression of black-white images with arithmetic coding. // IEEE Trans.Commun.COM. — № 29. — 1981. — Jun. — C. 858−867.
- Ziv J., Lempel A. Compression of individual sequences via variable-rate coding. // IEEE Trans.Inf.Theory IT-24(5. — No. 24. — 1978. — Sept. — Pp. 530−536.
- Bajaj C., Pascucci V., Zhuang G. Compression and coding of large CAD models: Ticam: The University of Texas at Austin, 1998.
- Isenburg M., Snoeyink J. Coding polygon meshes as compressable ASCII // 3DPVT '2002 / University of North Carolina at Chapel Hill and INRIA Sophia-Antipolis. — 2002.
- Kapoor N. S. Geometry based connectivity compression of triangular meshes. — 2000.
- Isenburg M., Snoeyink J. Coding with ASCII: compact, yet text-based 3D content // International Symposium on 3D Data Processing Visualization and Transmission. — 2002. — Pp. 609 — 616.
- Khodakovsky A., Alliez P., Desbrun M" Schroeder P. Near-optimal connectivity encoding of 2-manifold polygon meshes. — 2001.
- King D., Rossignac J., Szymczak A. Connectivity compression for irregular quadrilateral meshes: GVU TR-99−36: Georgia Tech, 1999.
- Taubin G., Horn W. et al. Geometry coding and VRML // IEEE. — Vol. 86. — 1998. — June. — Pp. 1228−1243.
- Andbjar C. Geometry simplification.— 1999. — February.
- Bajaj C. L., Pascucci V., Zhuang G. Single resolution compression of arr bitrary triangular meshes with properties // Data Compression Conference. — 1999. — Pp. 247−256.
- Hoppe H., DeRose T. et al. Mesh optimization // Computer Graphics. — 1993. — Vol. 27, no. Annual Conference Series. — Pp. 19−26.
- Hinker P., Hansen C. Geometric optimization // Proc. Visualization '93. — San Jose, Π‘ A: 1993. — October. — Pp. 189−195.
- Π¨ΠΈΠΊΠΈΠ½ E. Π., ΠΠΎΡΠ΅ΡΠΊΠΎΠ² Π. Π. ΠΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½Π°Ρ Π³ΡΠ°ΡΠΈΠΊΠ°. ΠΠΎΠ»ΠΈΠ³ΠΎΠ½Π°Π»ΡΠ½ΡΠ΅ ΠΌΠΎΠ΄Π΅Π»ΠΈ. — Π. ΠΠΈΠ°Π»ΠΎΠ³-ΠΠΠ€Π, 2000.
- Isenburg Π., Alliez P. Compressing hexahedral volume meshes // Pacific Graphics '2002 / University of North Carolina at Chapel Hill and INRLA Sophia-Antipolis. — 2002.
- And’ujar C. Octree-based Simplification of Polyhedral Solids: Cs dept / Universitat Polit’ecnica de Catalunya. — Barcelona, Spain, 1999.
- Isenburg M. Compressing polygon mesh connectivity with degree duality prediction // Graphics Interface '2002 / University of North Carolina at Chapel Hill. — 2002.
- Saupe D., KuskaJ. Compression of isosurfaces for structured volumes: Tech. rep. — 4 109 Leipzig, Germany: University of Leipzig, Computer Science Institute Augustusplatz, 2001. — November.
- Searching triangle strips guided by simplification criterion // WSCG 2001 Conference Proceedings / Ed. by V. Skala. — 2001.
- Xiang, Held, Mitchell. Fast and effective stripification of polygonal surface models (short) // SODA: ACM-SLAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms). — 1999.
- Carey R., Bell G., Marrin C. — The Virtual Reality Modeling Language. — ISO/IEC DIS 14 772−1, 1997. — April.
- Jackie Neider T. D., Woo M. — OpenGL Programming Guide — The Official Guide to Learning OpenGL, Version 1.1.— Addison-Wesley, Reading, MA, USA, 1997.
- Kronrod Π., Gotsman C. Optimized triangle mesh compression using prediction trees // Pacific Graphics '2000. — 2000.
- NganA. Simplification of 3D meshes. — 2000.
- Gumhold S., Strauer W. Real time compression of triangle mesh connectivity // Computer Graphics. — 1998. — Vol. 32, no. Annual Conference Series. — Pp. 133— 140.
- Schroeder W. J., Zarge J. A., Lorensen W. E. Decimation of triangle meshes // Computer Graphics. — 1992. — Vol. 26, no. 2. — Pp. 65 — 70.
- Szymczak A., Rossignac J. Grow & fold: Compression of tetrahedral meshes: Tech. Rep. SM99−021. — Atlanta USA: School of Mathematics Georgia Institute of Technology and Graphics, Visualization & Usability Center College of Computing, 1999. —January.
- Taubin G., Rossignac J. Geometric compression through topological surgery // ACM Transactions on Graphics. — 1998. — Vol. 17, no. 2. — Pp. 84−115.
- Π€Π΅Π΄ΠΎΡΠΎΠ² P. Π., ΠΠΎΡΠ°Π±Π»ΠΈΠ½ M. Π. Π Π°Π·ΡΠ°Π±ΠΎΡΠΊΠ° ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΈ ΡΡΠ΅Π΄ΡΡΠ² ΠΎΠΏΡΠΈ-ΠΌΠΈΠ·Π°ΡΠΈΠΈΡΠΎΡΠΌΠ°ΡΠ° vrml Π΄Π»Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ Π² ΡΠ΅ΡΠΈ ΠΈΠ½ΡΠ΅ΡΠ½Π΅Ρ // Π’Π΅Π·ΠΈΡΡ Π΄ΠΎΠΊΠ»Π°Π΄ΠΎΠ² 6-ΠΉ Π²ΡΠ΅ΡΠΎΡΡΠΈΠΉΡΠΊΠΎΠΉ ΠΠ’Π / Π ΠΠ Π’Π.— Π ΡΠ·Π°Π½Ρ: 2001.— Π‘. 154.
- Rossignac J. Geometric simplification and compression // SIG-GRAPH'97. — 1997.
- Rossignac J., Borrel P. Multi-resolution 3d approximations for rendering complex scenes // Geometric Modeling in Computer Graphics. — Springer Verlag, 1993. June-July. — Pp. 455−465.
- LowK. L., Tan T. S. Model simplification using vertex-clustering.
- Hoppe H. Progressive meshes // Computer Graphics.— 1996.— Vol. 30, no. Annual Conference Series. — Pp. 99— 108.
- Π€Π΅Π΄ΠΎΡΠΎΠ² P. Π., Π€Π΅Π΄ΠΎΡΠΎΠ² Π. Π. Π Π°Π·ΡΠ°Π±ΠΎΡΠΊΠ° ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΡ Π²ΠΈΠ·ΡΠ°Π»ΠΈΠ·Π°ΡΠΈΠΈ ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½ΡΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ // ΠΠΎΠ²ΡΡΠ΅Π½ΠΈΠ΅ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ ΡΠ°Π±ΠΎΡΡ ΠΆΠ΅Π»Π΅Π·Π½ΠΎΠ΄ΠΎΡΠΎΠΆΠ½ΠΎΠ³ΠΎ ΡΡΠ°Π½ΡΠΏΠΎΡΡΠ°.— 2000.— Π’. 2, № 20.— Π‘. 169 — 170.
- Evans F, Skiena S. S., Varshney A. Optimizing triangle strips for fast rendering // IEEE Visualization '96 / Ed. by R. Yagel, G. M. Nielson. — 1996. —Pp. 319−326.
- Bajaj C. L., Ihm /., Park S. Compression-based 3D texture mapping for real-time rendering // Graphical Models. — 2000. — Vol. 62, no. 6. — Pp. 391−410.
- Turk G. Re-tiling polygonal surfaces // Computer Graphics. — 1992. — Vol. 26, no. 2. — Pp. 55 64.
- SzymczakA., RossignacJ., King D. Piecewise regular meshes: Construction and compression: GVU GA 30 332. — Atlanta USA: Georgia Tech, 2002. — February.
- Yuen P., Khalili N., Mokhtarian F. Curvature estimation on smoothed 3d meshes: Tech. rep.: Centre for Vision, Speech and Signal Processing School of Electronic Engineering, Information Technology and Mathematics University of Surrey, 1999.
- Boehm W. t Prautzsch H. Geometric fundamentals.
- JoeW., Tony D. Barycentric coordinates for convex polytopes.— 1993.
- Golub G., Van Loan C. Matrix Computations. — 2nd edition. — University Press, 1989.
- Du W. A Study of Several Specific Secure Two-party Computation Problems: Ph.D. thesis / Purdue University. — West Lafayette, Indiana, 2001.
- L. Bajaj Π‘., Pascucci V., Zhuang G. Progressive compression and transmission of arbitrary triangular meshes // IEEE Visualization '99 / Ed. by D. Ebert, M. Gross, B. Hamann. — San Francisco: 1999. — Pp. 307 — 316.
- Taubin G. 3D geometry compression and progressive transmission // EUROGRAPHICS 99. — 1999.
- Hoppe H. Efficient implementation of progressive meshes // Computers and Graphics. — 1998. — Vol. 22, no. 1. — Pp. 27 36.
- Khodakovsky A., Schroder P., Sweldens W. Progressive geometry compression // Siggraph 2000, Computer Graphics Proceedings / Ed. by K. Akeley. — ACM Press / ACM SIGGRAPH / Addison Wesley Longman, 2000. — Pp. 271−278.
- Li J., Li J., ΠΠΈΠΎ Π‘. C. J. Progressive compression of 3D graphic models // International Conference on Multimedia Computing and Systems. — 1997. —Pp. 135−142.
- Pajarola R. f Rossignac J. Compressed progressive meshes // IEEE Transactions on Visualization and Computer Graphics. — 2000. — /. — Vol. 6, no. 1. —Pp. 79−93.
- Pajarola R. Π., Rossignac J., Szymczak A. Implant sprays: Compression of progressive tetrahedral mesh connectivity// IEEE Visualization '99 / Ed. by D. Ebert, M. Gross, B. Hamann. — San Francisco: 1999. — Pp. 299−306.
- Popovic J., Hoppe H. Progressive simplicial complexes // SIGGRAPH.— 1997. —Pp. 217−224.
- Cohen-Or D., Levin D., Remez O. Progressive compression of arbitrary triangular meshes // IEEE Visualization '99 / Ed. by D. Ebert, M. Gross, B. Hamann. — San Francisco: 1999. — Pp. 67 — 72.
- Progressive forest split compression / G. Taubin, A. Gueziec, W. Horn, F. Lazarus // Computer Graphics. — 1998. — Vol. 32, no. Annual Conference Series. — Pp. 123— 132.
- VarshneyA. A hierarchy of techniques for simplifying polygonal models // SIGGRAPH '97 Course Notes CD-ROM, Course 25: Multiresolu-tion Surface Modeling. ACM SIGGRAPH. — 1997. — August.
- ΠΠ°Ρ Π°ΡΠΎΠ² Π. Π., ΠΡΠ°Π³ΠΈΠ½ Π. Π. Π Π°Π·ΡΠ°Π±ΠΎΡΠΊΠ° ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΈΠ·ΠΌΠ΅Π½Π΅Π½ΠΈΡ Π³Π΅ΠΎΠΌΠ΅ΡΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΠΈ Π³ΡΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΡ ΠΎΠ±ΡΠ΅ΠΊΡΠΎΠ² Π΄Π»Ρ ΡΠΈΡΡΠ΅ΠΌ Π³Π΅Π½Π΅ΡΠ°ΡΠΈΠΈ Π²ΠΈΠ·ΡΠ°Π»ΡΠ½ΠΎΠΉ ΠΎΠ±ΡΡΠ°Π½ΠΎΠ²ΠΊΠΈ // ΠΠ΅ΡΠΎΠ΄Ρ ΠΈ ΡΡΡΡΠΎΠΉΡΡΠ²Π° ΠΏΠ΅ΡΠ΅Π΄Π°ΡΠΈ ΠΈ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΈ. — 2002. — Π’. 2. — Π‘. 88−92.
- Multiresolution analysis of arbitrary meshes / M. Eck, T. DeRose, T. Duchamp et al. // Computer Graphics. — 1995. — Vol. 29, no. Annual Conference Series. — Pp. 173—182.
- Shamir A., Bajaj C. L., Pascucci V. Multi-resolution dynamic meshes with arbitrary deformations // IEEE Visualization.— 2000.— Pp. 423−430.
- Π€Π΅Π΄ΠΎΡΠΎΠ² Π . Π. ΠΠ»Π³ΠΎΡΠΈΡΠΌΡ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΡΠ°ΡΠ΅ΡΡΠ°ΡΡΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΠΈ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΈΡ ΡΠ΅ΡΠ΅Π²ΠΎΠΉ ΠΏΠ΅ΡΠ΅Π΄Π°ΡΠΈ // ΠΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΠ΅ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΈ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ — ΠΠ·Π΄Π°ΡΠ΅Π»ΡΡΡΠ²ΠΎ ΠΠΎΡΠΊΠΎΠ²ΡΠΊΠΎΠ³ΠΎ ΡΠ½ΠΈΠ²Π΅ΡΡΠΈΡΠ΅ΡΠ°, ΠΠ°ΡΡΠ½ΠΎ-ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΡΡΠΈΠΉ Π²ΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΠΉ ΡΠ΅Π½ΡΡ ΠΠΠ£.— 2003.— Π’. 4, № 2, —Π‘. 47−57.
- Π€Π΅Π΄ΠΎΡΠΎΠ² Π . Π. ΠΠ΅ΡΠΎΠ΄Ρ ΡΠ΅ΡΠ΅Π²ΠΎΠΉ ΠΏΠ΅ΡΠ΅Π΄Π°ΡΠΈ, ΠΎΠΏΡΠΈΠΌΠΈΠ·ΠΈΡΠΎΠ²Π°Π½Π½ΡΡ ΡΠ°ΡΠ΅ΡΡΠ°ΡΡΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ. // ΠΠ½ΡΠΎΠΊΠΎΠΌΠΌΡΠ½ΠΈΠΊΠ°ΡΠΈΠΎΠ½Π½ΡΠ΅ ΡΠ΅Ρ Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ. — 2003.
- ΠΠ°Ρ Π°ΡΠΎΠ² Π. Π., ΠΠ°ΡΠ°Π½ΠΎΠ² Π. Π. Π‘ΠΈΠ½ΡΠ΅Π· ΠΈΠ·ΠΎΠ±ΡΠ°ΠΆΠ΅Π½ΠΈΠΉ ΠΏΡΠΎΡΡΠΆΠ΅Π½Π½ΡΡ ΡΡΠ°ΡΡΠΎΠ² ΠΌΠ΅ΡΡΠ½ΠΎΡΡΠΈ // ΠΠ΅ΡΠΎΠ΄Ρ ΠΈ ΡΡΡΡΠΎΠΉΡΡΠ²Π° ΠΏΠ΅ΡΠ΅Π΄Π°ΡΠΈ ΠΈ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΈ. — 2002. — Π’. 2. — Π‘. 98−102.
- Barequet, Sharir. Partial surface and volume matching in three dimensions // IEEETPAMI: IEEE Transactions on Pattern Analysis and Machine Intelligence.— 1997. —Vol. 19.
- Dorai C., Jain A. K. COSMOS a representation scheme for 3d free-form objects // IEEE Transactions on Pattern Analysis and Machine Intelligence. — 1997. — Vol. 19, no. 10. — Pp. 1115 — 1130.
- Osada R., Funkhouser T. et al. Matching 3d models with shape distributions // International Conference on Shape Modelling and Applications (SMI2001). — 2001. — May. — Pp. 154- 166.
- Novotni M., Klein R. A geometric approach to 3d object comparison // International Conference on Shape Modelling and Applications (SMI2001). — 2001. —May. — Pp. 167−175.
- Π Π΅ΠΏΠΏΠ΅Ρ X., Ayache N. A geometric algorithm to find small but highly similar 3D substructures in proteins // Bioinformatics.— 1998.— No. 14.—Pp. 516−522.
- Automated discovery of active motifs in three dimensional molecules // Knowledge Discovery and Data Mining.— 1997.— Pp. 89−95.
- Π€Π΅Π΄ΠΎΡΠΎΠ² P. Π. Π£ΠΏΠ°ΠΊΠΎΠ²ΠΊΠ° ΡΡΡΡ ΠΌΠ΅ΡΠ½ΡΡ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠΌ ΡΠ°Π·Π±ΠΈΠ΅Π½ΠΈΡ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π΅ ΡΠΎΡΠ΅ΠΊ, Π½Π° ΠΏΠΎΠ΄ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° Ρ ΠΎΠ³ΡΠ°Π½ΠΈΡΠΈΠ²Π°ΡΡΠΈΠΌ ΡΡΠ»ΠΎΠ²ΠΈΠ΅ΠΌ // Π’Π΅Π·ΠΈΡΡ Π΄ΠΎΠΊΠ»Π°Π΄ΠΎΠ² X Π ΠΎΡΡΠΈΠΉΡΠΊΠ°Ρ ΠΠ / ΠΠΠΠ’Π. — Π‘Π°ΠΌΠ°ΡΠ°: 2003. —ΠΌΠ°ΡΡ. — Π‘. 137.
- Π€Π΅Π΄ΠΎΡΠΎΠ² Π . Π. Π‘ΠΆΠ°ΡΠΈΠ΅ ΠΈΠ½ΠΆΠ΅Π½Π΅ΡΠ½ΡΡ ΠΠ-ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΠΏΡΠΈ ΠΏΠΎΠΌΠΎΡΠΈ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΏΠΎΠΈΡΠΊΠ° ΠΏΠ»ΠΎΡΠΊΠΈΡ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠΎΠ², Π΄Π»Ρ ΠΌΠΈΠ½ΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΡΠ΅ΡΠ΅Π²ΠΎΠ³ΠΎ ΡΡΠ°ΡΠΈΠΊΠ° // Π’Π΅Π·ΠΈΡΡ Π΄ΠΎΠΊΠ»Π°Π΄ΠΎΠ² XI Π ΠΎΡΡΠΈΠΉΡΠΊΠ°Ρ ΠΠ / ΠΠΠΠ’Π. — Π‘Π°ΠΌΠ°ΡΠ°: 2004.
- Π‘ΡΠ΅ΠΏΠ°Π½ΠΎΠ² Π. Π. Π‘ΡΠ΅ΡΠΈΡΠ΅ΡΠΊΠ°Ρ ΡΡΠΈΠ³ΠΎΠ½ΠΎΠΌΠ΅ΡΡΠΈΡ.— 2 ΠΈΠ·Π΄.— Π.-Π., 1948.
- Lamme Π‘. Lecons sur Les Coordonnees curvilignes et leurs diverses applications. — P., 1859.
- ΠΠ°ΠΏΡΠ΅Π² Π. Π€. ΠΠ»Π΅ΠΌΠ΅Π½ΡΡ Π²Π΅ΠΊΡΠΎΡΠ½ΠΎΠ³ΠΎ ΠΈΡΡΠΈΡΠ»Π΅Π½ΠΈΡ. — Π., 1975.
- Π¨ΠΈΠΊΠΈΠ½ Π. Π., ΠΠΎΡΠ΅ΡΠΊΠΎΠ² Π. Π. ΠΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½Π°Ρ Π³ΡΠ°ΡΠΈΠΊΠ°, Π΄ΠΈΠ½Π°ΠΌΠΈΠΊΠ° ΡΠ΅Π°Π»ΠΈΡΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΈΠ·ΠΎΠ±ΡΠ°ΠΆΠ΅Π½ΠΈΡ. — Π. ΠΠΈΠ°Π»ΠΎΠ³-ΠΠΠ€Π, 1995.
- Alliez P., Desbrun Π. Valence-driven connectivity encoding for 3D meshes // EG 2001 Proceedings / Ed. by A. Chalmers, T.-M. Rhyne. — Blackwell Publishing, 2001. — Vol. 20(3). — Pp. 480−489.
- Howard P. G. The design and analysis of efficient lossless data compression systems: Tech. Rep. CS-93−28: 1993.
- Zhuang G. Compression and Progressive Transmission of Three-Dimensional Models: Ph.D. thesis / Purdue University. — 1998.
- Jiankun L., JayKuo C. Embedded coding of mesh geometry: Tech. rep.: ISO/IEC JTC1/SC29/WG11 MPEG98/M3325, 1998. —March.
- Andersson O., Armstrong P., othes. — Scalable Vector Graphics (SVG) 1.1 Specification. — W3C, 2003. — January.
- P. D. — GZIP file format specification version 4.3. — Aladdin Enterprises, 1996. —May.