A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint

03/27/2018
by   Hamid Hoorfar, et al.
0

Given a simple polygon P of n vertices in the Plane. We study the problem of computing the visibility polygon from a given viewpoint q inside P where only few working variables can be used. The problem was previously solved in O(nr) time using O(1) variables for working space, where r denotes the cardinality of reflex vertices of P in the output. In this paper, we present an optimal in-place algorithm of O(n) time, and O(1) extra variables (in addition to the being in-place) for computing visibility area. If reporting the parts of P that are not in the visibility area is acceptable as result, our algorithm can be a constant-memory for computing visibility area. We improve time-complexity such that it just depends on n . Actually, we provide a linear-time and in-place algorithm for computing visibility area of a viewpoint inside a simple polygon.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2018

An Optimal Algorithm for Computing the Visibility Area of a Polygon from a Point Using Constant-Memory

Given a simple polygon P of n vertices in the Plane. We study the prob...
research
03/11/2021

Terrain prickliness: theoretical grounds for low complexity viewsheds

An important task when working with terrain models is computing viewshed...
research
08/16/2021

The Visibility Center of a Simple Polygon

We introduce the visibility center of a set of points inside a polygon –...
research
05/02/2019

Pseudo-Triangle Visibility Graph: Characterization and Reconstruction

The visibility graph of a simple polygon represents visibility relations...
research
10/21/1999

Finite-resolution hidden surface removal

We propose a hybrid image-space/object-space solution to the classical h...
research
01/19/2021

Local Complexity of Polygons

Many problems in Discrete and Computational Geometry deal with simple po...
research
10/03/2018

A Comparison of I/O-Efficient Algorithms for Visibility Computation on Massive Grid Terrains

Given a grid terrain T and a viewpoint v, the viewshed of v is the set o...

Please sign up or login with your details

Forgot password? Click here to reset