Consistent simplification of polyline tree bundles

DOI10.1007/978-3-030-89543-3_20OpenAlexW3210693694MaRDI QIDQ2695291

Yannick Bosch, Johannes Zink, Sabine Storandt, Joachim Spoerhase, Peter Schäfer

Publication date: 30 March 2023

Full work available at URL: https://arxiv.org/abs/2108.10790

zbMATH Keywords

planaritytree graphhardness of approximationdynamic programpolyline simplification

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Uses Software

• OpenStreetMap

Cites Work

• Unnamed Item
• Approximating the minimum maximal independence number
• On the Chain Pair Simplification Problem
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
• Simplification of Polyline Bundles

This page was built for publication: Consistent simplification of polyline tree bundles