Algorithmic aspects of proportional symbol maps

DOI10.1007/s00453-009-9281-8zbMath1202.68471OpenAlexW2160487122WikidataQ59782307 ScholiaQ59782307MaRDI QIDQ1957642

Bettina Speckmann, Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld

Publication date: 27 September 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9281-8

zbMATH Keywords

NP-hardnessGeometric algorithmsCartography

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10)

Related Items (6)

Improved Grid Map Layout by Point Set Matching ⋮ The visible perimeter of an arrangement of disks ⋮ Algorithms for Necklace Maps ⋮ Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation ⋮ The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms ⋮ Arc-based integer programming formulations for three variants of proportional symbol maps

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic fractional cascading
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Optimal packing and covering in the plane are NP-complete
• On \(k\)-sets in arrangements of curves and surfaces
• Dynamic orthogonal segment intersection search
• Planar Formulae and Their Uses
• The Problem of Compatible Representatives
• Surface Approximation and Geometric Partitions
• Planar Embeddings of Graphs with Specified Edge Lengths

This page was built for publication: Algorithmic aspects of proportional symbol maps