Multi-sided boundary labeling

DOI10.1007/S00453-015-0028-4MaRDI QIDQ334944zbMATH OpenOpenAlexFDO

Authors Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff

Publication date 1 November 2016

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.0750

zbMATH Keywords

computational geometryboundary labelingdynamic program

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: In the Boundary Labeling problem, we are given a set of $n$ points, referred to as sites, inside an axis-parallel rectangle $R$, and a set of $n$ pairwise disjoint rectangular labels that are attached to $R$ from the outside. The task is to connect the sites to the labels by non-intersecting rectilinear paths, so-called leaders, with at most one bend. In this paper, we study the Multi-Sided Boundary Labeling problem, with labels lying on at least two sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, such an algorithm has only been known for the cases in which labels lie on one side or on two opposite sides of $R$ (here a crossing-free solution always exists). The case where labels may lie on adjacent sides is more difficult. We present efficient algorithms for testing the existence of a crossing-free leader layout that labels all sites and also for maximizing the number of labeled sites in a crossing-free leader layout. For two-sided boundary labeling with adjacent sides, we further show how to minimize the total leader length in a crossing-free layout.

Recommendations

• Two-sided boundary labeling with adjacent sides
• Boundary labeling for rectangular diagrams
• Many-to-One Boundary Labeling
• Boundary labeling: Models and efficient algorithms for rectangular maps
• Algorithms for Multi-Criteria Boundary Labeling

Cites work

• A linear space algorithm for computing maximal common subsequences
• Algorithms for Multi-Criteria Boundary Labeling
• Boundary labeling with octilinear leaders
• Boundary labeling: Models and efficient algorithms for rectangular maps
• Disjoint Paths in the Plane
• Manhattan-geodesic embedding of planar graphs
• Many-to-One Boundary Labeling
• Many-to-one boundary labeling with backbones
• Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
• Point labeling with sliding labels
• Single bend wiring
• Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications

Cited in

(14)

• Multi-stack Boundary Labeling Problems
• Algorithms for Multi-criteria One-Sided Boundary Labeling
• Many-to-one boundary labeling with backbones
• Labeling nonograms: boundary labeling for curve arrangements
• One-and-a-half-side boundary labeling
• Faster multi-sided one-bend boundary labelling
• Algorithms for Multi-Criteria Boundary Labeling
• Boundary Labeling with Octilinear Leaders
• Two-sided boundary labeling with adjacent sides
• Many-to-One Boundary Labeling
• Boundary labeling with octilinear leaders
• Boundary labeling for rectangular diagrams
• Efficient Labeling of Collinear Sites
• Many-to-one boundary labeling with backbones

This page was built for publication: Multi-sided boundary labeling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334944)