Infrared and Laser Engineering, Volume. 31, Issue 2, 132(2002)
Fast TIN approximation based on entropy feature
References(6)
[1] [1] James H Clark. Hierarchicalgeometric models for visible surface algorithms[J]. CACM;1986;19(10):547-554.
[2] [2] L Paul Chew. Constrained Delaunay Triangulations[J]. Algorithmica;1989;4:97-108.
[3] [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] [4] Pankaj K.Agarwal;Subhash Suri. An efficient algorithm for terrainsimplification[A]. In Proc. ACM-SIAM Symposium Discrete Algorithms[C]. 1997. 139-147.
[5] [5] Cignoni P;Montani C;Scopigno R. A comparison of mesh simplificationalgorithms[J]. Computers &Graphics;1998;22(1):37-54.
[6] [6] Hugues Hoppe. Progressive meshes[A]. In SIGGRAPH'96 Proc.[C]. 1996. 99-108.
Tools
Get Citation
Copy Citation Text
[in Chinese], [in Chinese], [in Chinese], [in Chinese]. Fast TIN approximation based on entropy feature[J]. Infrared and Laser Engineering, 2002, 31(2): 132
Paper Information
© Copyright 2018-2021 | Chinese Laser Press.
All Rights Reserved 沪ICP备15018463号-20