α-Visibility

We study a new class of visibility problems based on the notion of α-visibility. Given an angle α and a collection of line segments $\ensuremath{{\cal S}}$ in the plane, a segment t is said to be α-visible from a point p, if there exists an empty triangle with one vertex at p and the side opposite to p on t such that the angle at p is α. In this model of visibility, we study the classical variants of point visibility, weak and complete segment visibility, and the construction of the visibility graph. We also investigate the natural query versions of these problems, when α is either fixed or specified at query time.

[1]  Joachim Gudmundsson,et al.  Planar visibility: testing and counting , 2010, SCG.

[2]  Mohammad Ghodsi,et al.  Query point visibility computation in polygons with holes , 2008, Comput. Geom..

[3]  Diane Loring Souvaine.  Computational geometry in a curved world (algorithm) , 1986 .

[4]  Jirí Matousek.  Range searching with efficient hierarchical cuttings , 1992, SCG '92.

[5]  T. Asano.  An Efficient Algorithm for Finding the Visibility Polygon for a Polygonal Region with Holes , 1985 .

[6]  Leonidas J. Guibas,et al.  The Robot Localization Problem , 1995, SIAM J. Comput..

[7]  John Hershberger,et al.  Finding the visibility graph of a simple polygon in time proportional to its size , 1987, SCG '87.

[8]  David P. Dobkin,et al.  Computational geometry in a curved world , 1990, Algorithmica.

[9]  Stephen K. Wismath,et al.  Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time , 2000, Int. J. Comput. Geom. Appl..

[10]  Michel Pocchiola,et al.  The visibility complex , 1993, SCG '93.

[11]  Leonidas J. Guibas,et al.  Visibility Queries and Maintenance in Simple Polygons , 2002, Discret. Comput. Geom..

[12]  Joseph S. B. Mitchell,et al.  An Optimal Algorithm for Computing Visibility in the Plane , 1995, SIAM J. Comput..

[13]  Mohammad Ghodsi,et al.  Weak Visibility of Two Objects in Planar Polygonal Scenes , 2007, ICCSA.

[14]  Tetsuo Asano,et al.  Visibility in the Plane , 2000, Handbook of Computational Geometry.

[15]  Andrew Granville,et al.  Visibility in the plane , 2009 .

[16]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[17]  Leonidas J. Guibas,et al.  Visibility of disjoint polygons , 2005, Algorithmica.

[18]  D. T. Lee,et al.  Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..

[19]  Prosenjit Bose,et al.  Efficient visibility queries in simple polygons , 2002, Comput. Geom..

[20]  David M. Mount,et al.  An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.

[21]  Sanjiv Kapoor,et al.  Visibility queries in a polygonal region , 2009, Comput. Geom..

[22]  Elefterios A. Melissaratos,et al.  Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions , 1992, SIAM J. Comput..

[23]  Hermann Brunn.  Über Kerneigebiete , 1913 .

[24]  Otfried Cheong,et al.  Reaching a Polygon with Directional Uncertainty , 2001, Int. J. Comput. Geom. Appl..

[25]  Joseph O'Rourke,et al.  Worst-case optimal algorithms for constructing visibility polygons with holes , 1986, SCG '86.

[26]  J. Ian Munro,et al.  Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[27]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[28]  Leonidas J. Guibas,et al.  Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.

[29]  Mohammad Ghodsi,et al.  Space/query-time tradeoff for computing the visibility polygon , 2009, Comput. Geom..

[30]  Timothy M. Chan.  Optimal Partition Trees , 2010, SCG.

[31]  Gert Vegter,et al.  The Visibility Diagram: a Data Structure for Visibility Problems and Motion Planning , 1990, Scandinavian Workshop on Algorithm Theory.