Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Efficient approximation algorithms for tiling and packing problems with rectangles
Journal of Algorithms
Optimal algorithm for a special point-labeling problem
Information Processing Letters
Algorithms for the placement of diagrams on maps
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Boundary labeling: models and efficient algorithms for rectangular maps
GD'04 Proceedings of the 12th international conference on Graph Drawing
New bounds on map labeling with circular labels
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
Driven by the industrial challenge of labeling maps for GIS applications, we investigate the problem of computing the largest convex partitioning of the map P such that the rectangular axis-parallel label L can be placed in it. The map region to be labeled is in general non-convex and may contain holes. Our main result is the new polygonal area removal (PAR) algorithm to identify the area within P where the center of the labelL can be placed. We then derive a new and faster algorithm based on the sweep technique that determines the complete set of maximum inscribed rectangles (MIR) in P in the most common case when rectangle sides have an axis-parallel orientation. The set of all maximum inscribed rectangles is then post-processed to produce the best size/orientation combination of the final label placement depending on the specific requirements from the end users.