• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Fast Polygonal Approximation of Terrains and Height Fields (1995)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [ftp.maths.tcd.ie]
  • [www.cs.cmu.edu]
  • [graphics.cs.uiuc.edu]
  • [graphics.cs.uiuc.edu]
  • [www.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www.ri.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Michael Garland , Paul S. Heckbert
Citations:131 - 5 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Garland95fastpolygonal,
    author = {Michael Garland and Paul S. Heckbert},
    title = {Fast Polygonal Approximation of Terrains and Height Fields},
    year = {1995}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Several algorithms for approximating terrains and other height fields using polygonal meshes are described, compared, and optimized. These algorithms take a height field as input, typically a rectangular grid of elevation data H(x; y), and approximate it with a mesh of triangles, also known as a triangulated irregular network, or TIN. The algorithms attempt to minimize both the error and the number of triangles in the approximation. Applications include fast rendering of terrain data for flight simulation and fitting of surfaces to range data in computer vision. The methods can also be used to simplify multi-channel height fields such as textured terrains or planar color images. The most successful method we examine is the greedy insertion algorithm. It begins with a simple triangulation of the domain and, on each pass, finds the input point with highest error in the current approximation and inserts it as a vertex in the triangulation. The mesh is updated either with Delaunay triangul...

Citations

7321 Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
1611 Computational geometry: An introduction - Preparata, Shamos - 1985
546 A comprehensive introduction to differential geometry - Spivak - 1979
422 Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams - Guibas, Stolfi - 1985
319 Mesh optimization - Hoppe, DeRose, et al.
275 Hierarchical geometric models for visible surface algorithms - Clark - 1976
143 Randomized incremental construction of Delaunay and Voronoi diagrams - Guibas, Knuth, et al. - 1992
141 Constrained delaunay triangulations - Chew - 1987
101 Computing Dirichlet tessellations in the plane - Green, Sibson - 1978
96 M.: Multiresolution modeling for fast rendering - Heckbert, Garland - 1994
81 Data Dependent Triangulation for Piecewise Linear Interpolation - Dyn, Levin, et al. - 1990
77 On the levels of detail in terrains - Berg, Dobrindt - 1995
73 Automatic extraction of irregular network digital terrain models - Fowler, Little - 1979
67 Software for C 1 surface interpolation - Lawson - 1977
55 Software for C surface interpolation - Lawson - 1977
36 A Comprehensive Introduction to Di erential Geometry, volume 3. Publish or Perish - Spivak - 1975
30 A pyramidal data structure for triangle-based surface description - DeFloriani - 1989
27 Triangulation algorithms for adaptive terrain modeling - Heller - 1990
26 Incremental delaunay triangulation - Lischinski - 1994
19 Adaptive approximations by piecewise linear polynomials on triangulations of subsets of scattered data - Rippa - 1992
18 Piecewise linear best L2 approximation on triangulations - Nadler - 1986
16 Data point selection for piecewise trilinear approximation. Computer Aided Geometric Design - Hamann, Chen - 1994
16 A drop heuristic conversion method for extracting irregular networks from digital elevation models - Lee - 1989
14 Serious Putty: Topological Design for Variational Curves and Surfaces - Welch - 1995
13 Parallel terrain triangulation - Puppo, Davis, et al. - 1994
10 Fast segmentation of range images into planar regions - Schmitt, Chen - 1991
10 Piecewise planar surface models from sampled data." Scientific visualization of physical phenomena - Southard - 1990
9 A Delaunay-based method for surface approximation - Floriani, Falcidieno, et al. - 1983
9 Survey of Surface Approximation Algorithms - Heckbert, Garland - 1997
8 Piecewise Linear Best L 2 approximation on triangulations - Nadler - 1986
8 Issues in iterative TIN generation to support large scale simulations - Polis, McKeown - 1993
8 Spatial Data Representations for Rapid Visualization and Analysis - Scarlatos - 1993
5 Adaptive range data approximation by constrained surface triangulation - Chen, Schmitt - 1993
2 Lessons learned from visual simulation - Jones - 1994
2 A method of image representation based on bivariate splines - McClure, Shwartz - 1989
2 Scarlatos and Theo Pavlidis. Optimizing triangulations by curvature equalization - Lori - 1992
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University