Fast TIN approximation based on entropy feature

[in Chinese]; [in Chinese]; [in Chinese]; [in Chinese]

Journals >Infrared and Laser Engineering >Volume 31 >Issue 2 >Page 132 > Article

Infrared and Laser Engineering
Vol. 31, Issue 2, 132 (2002)

Fast TIN approximation based on entropy feature

[in Chinese]^1、2, [in Chinese]², [in Chinese]², and [in Chinese]²

Author Affiliations

¹[in Chinese]

²[in Chinese]

show less

DOI: Cite this Article

[in Chinese], [in Chinese], [in Chinese], [in Chinese]. Fast TIN approximation based on entropy feature[J]. Infrared and Laser Engineering, 2002, 31(2): 132 Copy Citation Text

show less

References

[1] James H Clark. Hierarchicalgeometric models for visible surface algorithms[J]. CACM;1986;19(10):547-554.

[2] L Paul Chew. Constrained Delaunay Triangulations[J]. Algorithmica;1989;4:97-108.

[3] Michael Garland;Paul S Heckbert. Fast polygonal approximation of terrains andheight fields[R]. Technical Report CMU-CS-95-181. Comp.Sci.Dept.;Carnegie MellonUniversity;1995.

[4] Pankaj K.Agarwal;Subhash Suri. An efficient algorithm for terrainsimplification[A]. In Proc. ACM-SIAM Symposium Discrete Algorithms[C]. 1997. 139-147.

[5] Cignoni P;Montani C;Scopigno R. A comparison of mesh simplificationalgorithms[J]. Computers &Graphics;1998;22(1):37-54.

[6] Hugues Hoppe. Progressive meshes[A]. In SIGGRAPH'96 Proc.[C]. 1996. 99-108.

[in Chinese], [in Chinese], [in Chinese], [in Chinese]. Fast TIN approximation based on entropy feature[J]. Infrared and Laser Engineering, 2002, 31(2): 132

Download Citation

Tools

Save the article for my favorites

Paper Information