Algorithms for multi-criteria one-sided boundary labeling

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

17 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelGraph Drawing (15th International Symposium, GD'07, Sydney, Australia, September 23-26, 2007)
RedacteurenS.H. Hong, T. Nishizeki, W. Quan
Plaats van productieBerlin
UitgeverijSpringer
Pagina's243-254
ISBN van geprinte versie978-3-540-77537-9
DOI's
StatusGepubliceerd - 2008

Publicatie series

NaamLecture Notes in Computer Science
Volume4875
ISSN van geprinte versie0302-9743

Vingerafdruk

Duik in de onderzoeksthema's van 'Algorithms for multi-criteria one-sided boundary labeling'. Samen vormen ze een unieke vingerafdruk.

Citeer dit