Hierarchical approximation and localization

Visual Computer

Volumn 14, Issue 10, 1998, Pages 471-487

  Veltkamp, Remco C ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Bounding volumes; Hierarchical object representation; Polygonal and polyhedral approximation

Indexed keywords

APPROXIMATION THEORY; THREE DIMENSIONAL COMPUTER GRAPHICS;

HIERARCHICAL APPROXIMATION;

COMPUTATIONAL GEOMETRY;

EID: 0032262177     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003710050156     Document Type: Article

References (22)

1. Ballard DH (1981) Strip trees: a hierarchical representation for curves. Commun ACM 24:310-321
2. Berg M de (1997) Visualization of TINs. In: Kreveld M van, Nievergelt J, Roos T, Widmayer P (eds) Algorithmic foundations of geographic information systems (Lecture Notes in Computer Science, vol. 1340). Springer, Berlin Heidelberg New York, pp 79-97
3. DeFloriani L (1989) A pyramidal data structure for triangle-based surface description. IEEE Comput Graph Appl 9:67-80
4. DeHaemer Jr. MJ, Zyda MJ (1991) Simplification of objects rendered by polygonal approximations. Comput and Graph 15:175-184
5. Dijkstra EW (1959) A note on two problems in connection with graphs. Numerische Mathematik 1:269-271
6. Dominguez S, Günther O (1991) Performance analysis of three curve representation schemes. In: Bieri H, Noltemeier H (eds) Computational geometry - methods, algorithms and applications. Proceedings of the International Workshop on Computational Geometry CG'91, Bern. Switzerland (Lecture Notes in Computer Science, vol 553). Springer, Berlin Heidelberg New York, pp 37-56
7. Douglas DH, Peucker TK (1973) Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Canadian Cartog 10:112-122
8. Duda RO, Hart PE (1973) Pattern classification and scene analysis. John Wiley, New York
9. Faugeras OD, Hebert M, Mussi P, Boissonnat J-D (1984) Polyhedral approximation of 3-D objects without holes. Comput Vision Graph Image Processing 25:169-183
10. Günther O (1987) Efficient structures for geometric data management (Lecture Notes in Computer Sciences, vol 337). Springer, Berlin Heidelberg New York
11. Hershberger J, Snoeyink J (1992) Speeding up the Douglas-Peucker line simplification algorithm. Proceedings of the 5th International Symposium on Spatial Data Handling, IGU Commission on GIS, Charleston, South Carolina. University of South Carolina, Columbia, SC, 134-143
12. Hoppe H (1997) View-dependent refinement of progressive meshes. Comput Graph 31:189-198
13. Hoppe H (1996) Progressive meshes. Comput Graph 30:99-108
14. Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W (1993) Mesh optimization. Comput Graph 27:19-26
15. Imai H, Iri M (1988) Polygonal approximations of a curve - formulations and algorithms. In: Toussaint GT (ed) Computational morphology - a computational geometric approach to the analysis of form. North-Holland, pp 71-86
16. Luebke D, Erikson C (1997) View-dependent simplification of arbitrary polygonal environments. Comput Graph 31:199-208
17. 3 and related problems. SIAM J Comput 12:759-776
18. Ponce J, Faugeras O (1987) An object centered hierarchical representation for 3D objects: the prism tree Comput Vision Graph Image Processing 38:1-28
19. Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, Berlin Heidelberg New York
20. Schmitt F, Gholizadeh B (1986) Adaptive polyhedral approximation of digitized surfaces. Proceedings of the SPIE The International Society for Optical Engineering 595:101-108
21. Schroeder W (1992) Decimation of triangle meshes. Comput Graph 26:65-70
22. Turk G (1992) Re-tiling polygonal surfaces. Comput Graph 26:55-64