Three rules suffice for good label placement

DOI10.1007/s00453-001-0009-7zbMath0984.65015OpenAlexW2000080109MaRDI QIDQ5945915

No author found.

Publication date: 14 May 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0009-7

zbMATH Keywords

cartographycombinatorial optimizationsimulated annealingcomputational geometryexperimental comparisonlabel-placement algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Geodesy, mapping problems (86A30)

Related Items (8)

A Lagrangean decomposition for the maximum independent set problem applied to map labeling ⋮ Column generation approach for the point-feature cartographic label placement problem ⋮ Placing Arrows in Directed Graph Drawings ⋮ A new fast heuristic for labeling points ⋮ A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem ⋮ POPMUSIC for the point feature label placement problem ⋮ Optimal algorithm for a special point-labeling problem ⋮ Labeling points with given rectangles

This page was built for publication: Three rules suffice for good label placement