Computational geometry: an introduction
Computational geometry: an introduction
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Sorting in c log n parallel steps
Combinatorica
Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A unified approach to labeling graphical features
Proceedings of the fourteenth annual symposium on Computational geometry
A practical map labeling algorithm
Computational Geometry: Theory and Applications
Handbook of discrete and computational geometry
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Point labeling with sliding labels
Computational Geometry: Theory and Applications - Special issue on applications and challenges
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Elastic Labels Around the Perimeter of a Map
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
A Combinatorial Framework for Map Labeling
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
| Hi-index | 0.00 |
We deal with a map-labeling problem, named LOFL (Left-part Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each point is selected from a set of rectangles with various shapes satisfying the left-part ordered property, and is placed near to the point after scaled by a scaling factor σ which is common to all points. In this paper, we give an optimal O((n+m) log(n+ m)) algorithm to decide the feasibility of LOFL for a fixed scaling factor σ, and an O((n + m) log2(n + m)) time algorithm to find the largest feasible scaling factor σ, where n is the number of points and m is the number of edges of polygonal obstacles.