Location of Repository

A linear-time algorithm for constructing a circular visibility diagram

By Shuo-Yan Chou and T. C. Woo

Abstract

To computer circular visibility inside a simple polygon, circular arcs that emanate from a given interior point are classified with respect to the edges of the polygon they first intersect. Representing these sets of circular arcs by their centers results in a planar partition called the circular visibility diagram. An O(n) algorithm is given for constructing the circular visibility diagram for a simple polygon with n vertices

Publisher: Springer-Verlag; Springer-Verlag New York Inc.
Year: 1995
DOI identifier: 10.1007/BF01206329
OAI identifier: oai:deepblue.lib.umich.edu:2027.42/41346
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/2027.42/... (external link)
  • http://dx.doi.org/10.1007/BF01... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.