On directed graphs with an upward straight-line embedding into every point set

Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G Kobourov, Giuseppe Liotta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we study the problem of computing an up- ward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. We characterize the family of directed graphs that admit an upward straight-line embedding into every one-side convex point set, that is, into every point-set such that the top-most and the bottom-most points are adjacent in the convex hull of the point set. Also we show how to construct up- ward straight-line embeddings for a sub-class of directed paths when the point set is in general position.

Original languageEnglish (US)
Title of host publicationProceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009
Pages21-24
Number of pages4
StatePublished - 2009
Externally publishedYes
Event21st Annual Canadian Conference on Computational Geometry, CCCG 2009 - Vancouver, BC, Canada
Duration: Aug 17 2009Aug 19 2009

Other

Other21st Annual Canadian Conference on Computational Geometry, CCCG 2009
CountryCanada
CityVancouver, BC
Period8/17/098/19/09

Fingerprint

Directed graphs
Straight Line
Point Sets
Directed Graph
Line segment
Convex Hull
Convex Sets
Adjacent
Path
Computing
Vertex of a graph

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology

Cite this

Binucci, C., Di Giacomo, E., Didimo, W., Estrella-Balderrama, A., Frati, F., Kobourov, S. G., & Liotta, G. (2009). On directed graphs with an upward straight-line embedding into every point set. In Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009 (pp. 21-24)

On directed graphs with an upward straight-line embedding into every point set. / Binucci, Carla; Di Giacomo, Emilio; Didimo, Walter; Estrella-Balderrama, Alejandro; Frati, Fabrizio; Kobourov, Stephen G; Liotta, Giuseppe.

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. 2009. p. 21-24.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Binucci, C, Di Giacomo, E, Didimo, W, Estrella-Balderrama, A, Frati, F, Kobourov, SG & Liotta, G 2009, On directed graphs with an upward straight-line embedding into every point set. in Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. pp. 21-24, 21st Annual Canadian Conference on Computational Geometry, CCCG 2009, Vancouver, BC, Canada, 8/17/09.
Binucci C, Di Giacomo E, Didimo W, Estrella-Balderrama A, Frati F, Kobourov SG et al. On directed graphs with an upward straight-line embedding into every point set. In Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. 2009. p. 21-24
Binucci, Carla ; Di Giacomo, Emilio ; Didimo, Walter ; Estrella-Balderrama, Alejandro ; Frati, Fabrizio ; Kobourov, Stephen G ; Liotta, Giuseppe. / On directed graphs with an upward straight-line embedding into every point set. Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009. 2009. pp. 21-24
@inproceedings{89956144313c418583bc3a78630435c5,
title = "On directed graphs with an upward straight-line embedding into every point set",
abstract = "In this paper we study the problem of computing an up- ward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. We characterize the family of directed graphs that admit an upward straight-line embedding into every one-side convex point set, that is, into every point-set such that the top-most and the bottom-most points are adjacent in the convex hull of the point set. Also we show how to construct up- ward straight-line embeddings for a sub-class of directed paths when the point set is in general position.",
author = "Carla Binucci and {Di Giacomo}, Emilio and Walter Didimo and Alejandro Estrella-Balderrama and Fabrizio Frati and Kobourov, {Stephen G} and Giuseppe Liotta",
year = "2009",
language = "English (US)",
pages = "21--24",
booktitle = "Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009",

}

TY - GEN

T1 - On directed graphs with an upward straight-line embedding into every point set

AU - Binucci, Carla

AU - Di Giacomo, Emilio

AU - Didimo, Walter

AU - Estrella-Balderrama, Alejandro

AU - Frati, Fabrizio

AU - Kobourov, Stephen G

AU - Liotta, Giuseppe

PY - 2009

Y1 - 2009

N2 - In this paper we study the problem of computing an up- ward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. We characterize the family of directed graphs that admit an upward straight-line embedding into every one-side convex point set, that is, into every point-set such that the top-most and the bottom-most points are adjacent in the convex hull of the point set. Also we show how to construct up- ward straight-line embeddings for a sub-class of directed paths when the point set is in general position.

AB - In this paper we study the problem of computing an up- ward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. We characterize the family of directed graphs that admit an upward straight-line embedding into every one-side convex point set, that is, into every point-set such that the top-most and the bottom-most points are adjacent in the convex hull of the point set. Also we show how to construct up- ward straight-line embeddings for a sub-class of directed paths when the point set is in general position.

UR - http://www.scopus.com/inward/record.url?scp=84883046697&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883046697&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84883046697

SP - 21

EP - 24

BT - Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009

ER -