Consistent simplification of polyline tree bundles

DOI10.1007/978-3-030-89543-3_20MaRDI QIDQ2695291zbMATH OpenOpenAlexFDO

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

Publication date 30 March 2023

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

zbMATH Keywords

dynamic programhardness of approximationplanaritypolyline simplificationtree graph

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

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

Cited in

(1)

• Closest univariate convex linear-quadratic function approximation with minimal number of pieces

Describes a project that uses

Uses Software

• OpenStreetMap

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

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