Multi-sided boundary labeling

DOI10.1007/s00453-015-0028-4zbMath1348.68283arXiv1305.0750OpenAlexW3102064085MaRDI QIDQ334944

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

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)

Related Items (4)

Labeling nonograms: boundary labeling for curve arrangements ⋮ Faster multi-sided one-bend boundary labelling ⋮ Planar drawings of fixed-mobile bigraphs ⋮ Boundary Labeling for Rectangular Diagrams

Cites Work

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

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