A practical map labeling algorithm.
DOI10.1016/S0925-7721(96)00007-7zbMATH Open1133.52306DBLPjournals/comgeo/WelzlWW97OpenAlexW1988207841WikidataQ55918918 ScholiaQ55918918MaRDI QIDQ2482896FDOQ2482896
Authors: F. Wagner, Alexander Wolff 
Publication date: 25 April 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(96)00007-7
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)
Cites Work
- The Problem of Compatible Representatives
- On the Complexity of Timetable and Multicommodity Flow Problems
- Approximate map labeling is in \(\Omega (n\log n)\)
- Efficient Algorithms for Geometric Graph Search Problems
- Title not available (Why is that?)
- An application of point pattern matching in astronautics
- Title not available (Why is that?)
Cited In (9)
- An efficient and effective approximation algorithm for the Map Labeling Problem
- POINT SET LABELING WITH SPECIFIED POSITIONS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Models and methods for cartographic label placement
- On point covers of \(c-\)oriented polygons
- Placing labels in road maps: algorithms and complexity
- A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
- LABELING POINTS ON A SINGLE LINE
Uses Software
This page was built for publication: A practical map labeling algorithm.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482896)
