1 Search Results for "Asadollahpoor, Pooya Zafar"


Document
Geometric Spanners for Points Inside a Polygonal Domain

Authors: Mohammad Ali Abam, Marjan Adeli, Hamid Homapour, and Pooya Zafar Asadollahpoor

Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)


Abstract
Let P be a set of n points inside a polygonal domain D. A polygonal domain with h holes (or obstacles) consists of h disjoint polygonal obstacles surrounded by a simple polygon which itself acts as an obstacle. We first study t-spanners for the set P with respect to the geodesic distance function d where for any two points p and q, d(p,q) is equal to the Euclidean length of the shortest path from p to q that avoids the obstacles interiors. For a case where the polygonal domain is a simple polygon (i.e., h=0), we construct a (sqrt(10)+eps)-spanner that has O(n log^2 n) edges where eps is the a given positive real number. For a case where there are h holes, our construction gives a (5+eps)-spanner with the size of O(sqrt(h) n log^2 n). Moreover, we study t-spanners for the visibility graph of P (VG(P), for short) with respect to a hole-free polygonal domain D. The graph VG(P) is not necessarily a complete graph or even connected. In this case, we propose an algorithm that constructs a (3+eps)-spanner of size almost O(n^{4/3}). In addition, we show that there is a set P of n points such that any (3-eps)-spanner of VG(P) must contain almost n^2 edges.

Cite as

Mohammad Ali Abam, Marjan Adeli, Hamid Homapour, and Pooya Zafar Asadollahpoor. Geometric Spanners for Points Inside a Polygonal Domain. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 186-197, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


Copy BibTex To Clipboard

@InProceedings{abam_et_al:LIPIcs.SOCG.2015.186,
  author =	{Abam, Mohammad Ali and Adeli, Marjan and Homapour, Hamid and Asadollahpoor, Pooya Zafar},
  title =	{{Geometric Spanners for Points Inside a Polygonal Domain}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{186--197},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.186},
  URN =		{urn:nbn:de:0030-drops-51378},
  doi =		{10.4230/LIPIcs.SOCG.2015.186},
  annote =	{Keywords: Geometric Spanners, Polygonal Domain, Visibility Graph}
}
  • Refine by Author
  • 1 Abam, Mohammad Ali
  • 1 Adeli, Marjan
  • 1 Asadollahpoor, Pooya Zafar
  • 1 Homapour, Hamid

  • Refine by Classification

  • Refine by Keyword
  • 1 Geometric Spanners
  • 1 Polygonal Domain
  • 1 Visibility Graph

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2015

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail