---
res:
  bibo_abstract:
  - 'The straight skeleton of a polygon is the geometric graph obtained by tracing
    the vertices during a mitered offsetting process. It is known that the straight
    skeleton of a simple polygon is a tree, and one can naturally derive directions
    on the edges of the tree from the propagation of the shrinking process. In this
    paper, we ask the reverse question: Given a tree with directed edges, can it be
    the straight skeleton of a polygon? And if so, can we find a suitable simple polygon?
    We answer these questions for all directed trees where the order of edges around
    each node is fixed.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Oswin
      foaf_name: Aichholzer, Oswin
      foaf_surname: Aichholzer
  - foaf_Person:
      foaf_givenName: Therese
      foaf_name: Biedl, Therese
      foaf_surname: Biedl
  - foaf_Person:
      foaf_givenName: Thomas
      foaf_name: Hackl, Thomas
      foaf_surname: Hackl
  - foaf_Person:
      foaf_givenName: Martin
      foaf_name: Held, Martin
      foaf_surname: Held
  - foaf_Person:
      foaf_givenName: Stefan
      foaf_name: Huber, Stefan
      foaf_surname: Huber
      foaf_workInfoHomepage: http://www.librecat.org/personId=4700A070-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-8871-5814
  - foaf_Person:
      foaf_givenName: Peter
      foaf_name: Palfrader, Peter
      foaf_surname: Palfrader
  - foaf_Person:
      foaf_givenName: Birgit
      foaf_name: Vogtenhuber, Birgit
      foaf_surname: Vogtenhuber
  bibo_doi: 10.1007/978-3-319-27261-0_28
  bibo_volume: 9411
  dct_date: 2015^xs_gYear
  dct_identifier:
  - UT:000373628600028
  dct_isPartOf:
  - http://id.crossref.org/issn/978-3-319-27260-3
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: Representing directed trees as straight skeletons@
...