CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThis paper studies the problem of computing labeled orthogonal drawings. A label is modeled as a rectangle of prescribed size and it can be associated with either a vertex or an edge. Several optimization goals are taken into account. Namely, the labeled drawing can be required to have minimum total edge length, minimum width, minimum height, or minimum area. We present ILP models to compute optimal drawings with respect to the first three objectives and an algorithm exploiting these models which computes a drawing of minimum area (the compaction problem is known to be NP-complete in general)
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
| Titolo: | Computing Labeled Orthogonal Drawings |
| Autori: | |
| Data di pubblicazione: | 2002 |
| Rivista: | |
| Abstract: | This paper studies the problem of computing labeled orthogonal drawings. A label is modeled as a rectangle of prescribed size and it can be associated with either a vertex or an edge. Several optimization goals are taken into account. Namely, the labeled drawing can be required to have minimum total edge length, minimum width, minimum height, or minimum area. We present ILP models to compute optimal drawings with respect to the first three objectives and an algorithm exploiting these models which computes a drawing of minimum area (the compaction problem is known to be NP-complete in general) |
| Handle: | http://hdl.handle.net/11392/1624470 |
| ISBN: | 3-540-00158-1 |
| Appare nelle tipologie: | 04.1 Contributi in atti di convegno (in Rivista) |
File in questo prodotto:
Copyright © 2018