Abstract
A rectilinear map consists of a set of mutually non-intersecting rectilinear (i.e., horizontal or vertical) line segments, and each segment is allowed to use a rectangular label of height B and length the same as the segment. Sliding labels are not restricted to any finite number of predefined positions but can slide and be placed at any position as long as it intersects the segment. This paper considers three versions of the problem of labeling a rectilinear map with sliding labels and presents efficient exact and approximation algorithms for them.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computational Geometry & Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
