<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>7572</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>87</volume>
    <type>article</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2019-11-13</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Routing in polygonal domains</title>
    <abstract language="eng">We consider the problem of routing a data packet through the visibility graph of a polygonal domain P with n vertices and h holes. We may preprocess P to obtain a "label" and a "routing table" for each vertex of P. Then, we must be able to route a data packet between any two vertices p and q of P, where each step must use only the label of the target node q and the routing table of the current node. &#13;
&#13;
For any fixed epsilon &gt; 0, we present a routing scheme that always achieves a routing path whose length exceeds the shortest path by a factor of at most 1 + epsilon. The labels have O(log n) bits, and the routing tables are of size O(((epsilon^-1)+h)log n). The preprocessing time is O((n^2)log n). It can be improved to O(n^2) for simple polygons.</abstract>
    <parentTitle language="eng">Computational Geometry, Theory and Applications</parentTitle>
    <identifier type="doi">10.1016/j.comgeo.2019.101593</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Bahareh Banyassady</author>
    <submitter>Bahareh Banyassady</submitter>
    <author>Man-Kwun Chiu</author>
    <author>Matias Korman</author>
    <author>Wolfgang Mulzer</author>
    <author>André van Renssen</author>
    <author>Marcel Roeloffzen</author>
    <author>Paul Seiferth</author>
    <author>Yannik Stein</author>
    <author>Birgit Vogtenhuber</author>
    <author>Max Willert</author>
    <collection role="institutes" number="vis">Visual Data Analysis</collection>
    <collection role="institutes" number="visalgo">Visual Data Analysis in Science and Engineering</collection>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="institutes" number="VDcC">Visual and Data-centric Computing</collection>
  </doc>
</export-example>
