On d-regular schematization of embedded paths

DOI10.1016/J.COMGEO.2013.10.002MaRDI QIDQ390156zbMATH OpenOpenAlexFDO

Authors Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter

Publication date 22 January 2014

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2013.10.002

zbMATH Keywords

dynamic programminggraph drawingmixed integer linear programmingNP-hardnesspath schematization

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Mixed integer programming (90C11) Dynamic programming (90C39)

Review text

Motivated by drawing route sketches in road networks, the authors study the \(d\)-regular path schematization problem, which has two main goals: To preserve the user's mental map through maintaining the orthogonal order, and to reduce the visual complexity using restricted edge slopes.

Recommendations

• On \(d\)-regular schematization of embedded paths
• Path Schematization for Route Sketches
• Schematization of road networks
• Schematization of networks
• Path Simplification for Metro Map Layout

Cited in

(3)

• Schematization of networks
• On \(d\)-regular schematization of embedded paths
• Universal slope sets for upward planar drawings

This page was built for publication: On \(d\)-regular schematization of embedded paths

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