A linear-time algorithm for constructing a circular visibility diagram

Algorithmica 14 (1995)
  Copy   BIBTEX

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 algorithm is given for constructing the circular visibility diagram for a simple polygon with n vertices.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,571

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Pieces of time.Valerie Young - 2002 - Nursing Philosophy 3 (2):90-103.
The Tokenization of 'Zero' and 'One'.Ilexa Yardley - 2021 - Https://Medium.Com/the-Circular-Theory/.
A decision algorithm for linear sentences on a PFM.Lian Li, Huilin Li & Yixun Liu - 1993 - Annals of Pure and Applied Logic 59 (3):273-286.
Applying Allen's constraint propagation algorithm for non-linear time.El?Bieta Hajnicz - 1996 - Journal of Logic, Language and Information 5 (2):157-175.
Linear Processing with Pregroups.Anne Preller - 2007 - Studia Logica 87 (2-3):171-197.
The Cryptic Universe.Ilexa Yardley - 2021 - Https://Medium.Com/the-Circular-Theory.
The New Visibility.John B. Thompson - 2005 - Theory, Culture and Society 22 (6):31-51.
Efficiency of pregroups and the French noun phrase.Sylvain Degeilh & Anne Preller - 2005 - Journal of Logic, Language and Information 14 (4):423-444.

Analytics

Added to PP
2021-08-05

Downloads
2 (#1,800,073)

6 months
1 (#1,469,469)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references