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: Contribution to conferencePaper

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)
Pages21-24
Number of pages4
StatePublished - Dec 1 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

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology

Fingerprint Dive into the research topics of 'On directed graphs with an upward straight-line embedding into every point set'. Together they form a unique fingerprint.

Cite this