## 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 language | English (US) |
---|---|

Pages | 21-24 |

Number of pages | 4 |

State | Published - Dec 1 2009 |

Externally published | Yes |

Event | 21st Annual Canadian Conference on Computational Geometry, CCCG 2009 - Vancouver, BC, Canada Duration: Aug 17 2009 → Aug 19 2009 |

### Other

Other | 21st Annual Canadian Conference on Computational Geometry, CCCG 2009 |
---|---|

Country | Canada |

City | Vancouver, BC |

Period | 8/17/09 → 8/19/09 |

## ASJC Scopus subject areas

- Computational Mathematics
- Geometry and Topology