Algorithms for ε-Approximations of Terrains

DOI10.1007/978-3-540-70575-8_37MaRDI QIDQ3521939zbMATH OpenOpenAlexFDO

Authors Jeff M. Phillips

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_37

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Relative (p, )-approximations in geometry
• Approximations and optimal geometric divide-and-conquer
• On approximate halfspace range counting and relative epsilon-approximations
• Approximating extent measures of points.
• FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE

Cited in

(15)

• On simplifying dot maps.
• Matching polyhedral terrains using overlays of envelopes
• scientific article; zbMATH DE number 1688626 (Why is no real title available?)
• Subsampling in smoothed range spaces
• COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
• Geometric Matching Algorithms for Two Realistic Terrains
• scientific article; zbMATH DE number 5525421 (Why is no real title available?)
• A Discrete Approach to Compute Terrain Morphology
• Removing local extrema from imprecise terrains
• scientific article; zbMATH DE number 1323022 (Why is no real title available?)
• Computing and Combinatorics
• Computing Large Planar Regions in Terrains
• Near-optimal coresets of kernel density estimates
• Finding planar regions in a terrain -- in practice and with a guarantee
• Computing data distribution from query selectivities

This page was built for publication: Algorithms for ε-Approximations of Terrains

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