## Abstract

Point feature map labeling is a geometric problem, in which a set of input points must be labeled with a set of disjoint rectangles (the bounding boxes of the label texts). Typically, labeling models either use internal labels, which must touch their feature point, or external (boundary) labels, which are placed on one of the four sides of the input points’ bounding box and which are connected to their feature points by crossing-free leader lines. In this paper we study polynomial-time algorithms for maximizing the number of internal labels in a mixed labeling model that combines internal and external labels. The model requires that all leaders are parallel to a given orientation θ∈[0,2π)

, whose value influences the geometric properties and hence the running times of our algorithms.

, whose value influences the geometric properties and hence the running times of our algorithms.

Original language | English |
---|---|

Title of host publication | Algorithms and Complexity |

Subtitle of host publication | 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings |

Editors | Vangelis Th. Paschos, Peter Widmayer |

Publisher | Springer |

Pages | 339–351 |

Edition | 1 |

ISBN (Electronic) | 978-3-319-18173-8 |

ISBN (Print) | 978-3-319-18172-1 |

DOIs | |

Publication status | Published - 22 Apr 2015 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer |

Volume | 9079 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

## Keywords

- CG, GD, GIS