Remarks on the computation of the horizon of a digital terrain
From MaRDI portal
Publication:1412555
DOI10.1016/S0096-3003(02)00608-2zbMath1032.65021MaRDI QIDQ1412555
Publication date: 25 November 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Descriptive geometry (51N05)
Cites Work
- Finding the upper envelope of n line segments in O(n log n) time
- On sorting triangles in a Delaunay tessellation
- The upper envelope of piecewise linear functions: Tight bounds on the number of faces
- The upper envelope of piecewise linear functions: Algorithms and applications
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- A sweepline algorithm for Voronoi diagrams
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Two algorithms for constructing a Delaunay triangulation
- Two Dimensional Interpolation from Random Data
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
