On Map Labeling with Leaders
From MaRDI portal
Publication:3644729
DOI10.1007/978-3-642-03456-5_20zbMath1258.68173OpenAlexW1552942606MaRDI QIDQ3644729
Publication date: 12 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_20
Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Labeling a rectilinear map more efficiently
- Applications of a semi-dynamic convex hull algorithm
- Label placement by maximum independent set in rectangles
- Approximate map labeling is in \(\Omega (n\log n)\)
- Geometry Helps in Matching
- Boundary Labeling with Octilinear Leaders
- Advances in Discrete and Computational Geometry
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- Many-to-One Boundary Labeling
- Multi-stack Boundary Labeling Problems
- Algorithms for Multi-criteria One-Sided Boundary Labeling
- Graph Drawing
This page was built for publication: On Map Labeling with Leaders