Removing local extrema from imprecise terrains
From MaRDI portal
Publication:419504
DOI10.1016/j.comgeo.2012.02.002zbMath1239.65017OpenAlexW1548261389MaRDI QIDQ419504
Chris Gray, Frank Kammer, Rodrigo I. Silveira, Maarten Löffler
Publication date: 18 May 2012
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.02.002
Related Items
Fréchet Distance for Uncertain Curves ⋮ On partitioning a graph into two connected subgraphs ⋮ Unnamed Item ⋮ Optimal topological simplification of discrete functions on surfaces ⋮ Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) ⋮ Disjoint paths and connected subgraphs for \(H\)-free graphs ⋮ Disjoint paths and connected subgraphs for \(H\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Generating realistic terrains with higher-order Delaunay triangulations
- Partitioning graphs into connected parts
- Higher order Delaunay triangulations
- Algorithmic construction of sets for k -restrictions
- I/O-efficient batched union-find and its applications to terrain analysis
- FLOODING COUNTRIES AND DESTROYING DAMS
- The Complexity of Minimum Convex Coloring
- On Partitioning a Graph into Two Connected Subgraphs
- Planar Formulae and Their Uses
- The Problem of Compatible Representatives
- SMOOTHING IMPRECISE 1.5D TERRAINS