Removing local extrema from imprecise terrains

DOI10.1016/J.COMGEO.2012.02.002MaRDI QIDQ419504zbMATH OpenOpenAlexFDO

Authors Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira

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

zbMATH Keywords

data imprecisionlocal minimaP2-ConP2-MaxConterrain analysis

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Terrain simplification by minimization of the local deformation
• scientific article; zbMATH DE number 2064502
• Computing realistic terrains from imprecise elevations
• Optimization-based terrain reconstruction from contour maps
• Algorithms for ε-Approximations of Terrains
• scientific article; zbMATH DE number 1688626
• An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains

Cites work

• Algorithmic construction of sets for k -restrictions
• Flooding countries and destroying dams
• Generating realistic terrains with higher-order Delaunay triangulations
• Higher order Delaunay triangulations
• scientific article; zbMATH DE number 1670858 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• I/O-efficient batched union-find and its applications to terrain analysis
• On partitioning a graph into two connected subgraphs
• Partitioning graphs into connected parts
• Planar Formulae and Their Uses
• SMOOTHING IMPRECISE 1.5D TERRAINS
• The Complexity of Minimum Convex Coloring
• The Problem of Compatible Representatives

Cited in

(17)

• Flooding countries and destroying dams
• Smoothing Imprecise 1.5D Terrains
• Flooding Countries and Destroying Dams
• scientific article; zbMATH DE number 2064502 (Why is no real title available?)
• 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
• Fréchet Distance for Uncertain Curves
• Computing realistic terrains from imprecise elevations
• On partitioning a graph into two connected subgraphs
• Guarding precise and imprecise polyhedral terrains with segments
• Optimal topological simplification of discrete functions on surfaces
• Fréchet distance for uncertain curves
• The parameterized complexity landscape of two-sets cut-uncut
• Two-sets cut-uncut on planar graphs
• The parameterized complexity landscape of two-sets cut-uncut
• Connectivity-preserving minimum separator in AT-free graphs

This page was built for publication: Removing local extrema from imprecise terrains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419504)