Horizon computation on a hierarchical triangulated terrain model
- 1 March 1995
- journal article
- research article
- Published by Springer Nature in The Visual Computer
- Vol. 11 (3), 134-149
- https://doi.org/10.1007/bf01898599
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Extracting contour lines from a hierarchical surface modelComputer Graphics Forum, 1993
- Applications of random sampling to on-line algorithms in computational geometryDiscrete & Computational Geometry, 1992
- Hierarchical triangulation using cartographic coherenceCVGIP: Graphical Models and Image Processing, 1992
- A hierarchical triangle-based model for terrain descriptionPublished by Springer Nature ,1992
- Minimal roughness property of the Delaunay triangulationComputer Aided Geometric Design, 1990
- Finding the upper envelope of n line segments in O(n log n) timeInformation Processing Letters, 1989
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- An object centered hierarchical representation for 3D objects: The prism treeComputer Vision, Graphics, and Image Processing, 1987
- A hierarchical structure for surface approximationComputers & Graphics, 1984