Simplifying massive planar subdivisions

DOI10.1137/1.9781611973198.3MaRDI QIDQ5232487zbMATH OpenOpenAlexFDO

Authors Lars Arge, Jakob Truelsen, Jungwoo Yang

Publication date 12 September 2019

Published in 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973198.3

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Area-preserving subdivision simplification with topology constraints: exactly and in practice
• Simplifying a polygonal subdivision while keeping it simple
• I/O-efficient contour tree simplification
• Progressive simplification of polygonal curves
• Map simplification with topology constraints: exactly and in practice

Cited in

(7)

• On simplifying dot maps.
• Terrain simplification by minimization of the local deformation
• I/O-efficient contour tree simplification
• Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time
• Map simplification with topology constraints: exactly and in practice
• Area-preserving subdivision simplification with topology constraints: exactly and in practice
• Simplifying a polygonal subdivision while keeping it simple

This page was built for publication: Simplifying massive planar subdivisions

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