Algorithms for multi-criteria one-sided boundary labeling

M. Benkert, H.J. Haverkort, M. Kroll, M. Nöllenburg

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

15 Citations (Scopus)

Abstract

We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithm finds a collection of non-intersecting leaders that minimizes the total number of bends, the total length, or any other ‘badness’ function of the leaders. An experimental evaluation of the performance is included. This work was started on the 9th "Korean" Workshop on Computational Geometry and Geometric Networks at Schloss Dagstuhl, Germany, 2006.
Original languageEnglish
Title of host publicationGraph Drawing (15th International Symposium, GD'07, Sydney, Australia, September 23-26, 2007)
EditorsS.H. Hong, T. Nishizeki, W. Quan
Place of PublicationBerlin
PublisherSpringer
Pages243-254
ISBN (Print)978-3-540-77537-9
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
Volume4875
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Algorithms for multi-criteria one-sided boundary labeling'. Together they form a unique fingerprint.

Cite this