Computing Large Planar Regions in Terrains
From MaRDI portal
Recommendations
- FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE
- Finding planar regions in a terrain -- in practice and with a guarantee
- Algorithms for ε-Approximations of Terrains
- Computing realistic terrains from imprecise elevations
- Terrain Modeling Using Voronoi Hierarchies
- A Discrete Approach to Compute Terrain Morphology
- I/O-Efficient Algorithms for Problems on Grid-Based Terrains
- COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
Cites work
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1947380 (Why is no real title available?)
- scientific article; zbMATH DE number 1775391 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 1445368 (Why is no real title available?)
- Near-optimal fully-dynamic graph connectivity
- On a circle placement problem
- On a class of \(O(n^ 2)\) problems in computational geometry
- Surface Approximation and Geometric Partitions
Cited in
(8)- Computing large planar regions in terrains, with an application to fracture surfaces
- scientific article; zbMATH DE number 2130516 (Why is no real title available?)
- COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
- Finding planar regions in a terrain -- in practice and with a guarantee
- Computing elevation maxima by searching the Gauss sphere
- FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE
- Large \(k\)-gons in a 1.5D terrain
- Extreme elevation on a 2-manifold
This page was built for publication: Computing Large Planar Regions in Terrains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917094)