volume 27, issue 4, P461-483 2002
DOI: 10.1007/s00454-001-0089-9
View full text
|
|
Share

Abstract: In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P. We provide a mechanism for expressing the visibility polygon from a point as the disjoint union of logarithmically many canonical pieces using a quadratic-space data structure. This allows us to report visibility polygons in time proportional to their size, but without the cubic space overhead of earlier methods. The same canonical decomposition can be used to determine visibility within a fru…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
39
0

Publication Types

Select...

Relationship

0
0

Authors

Journals