Terrain visibility with multiple viewpoints

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43925561" target="_blank" >RIV/49777513:23520/14:43925561 - isvavai.cz</a>

Result on the web

<a href="http://www.worldscientific.com/doi/abs/10.1142/S0218195914600085" target="_blank" >http://www.worldscientific.com/doi/abs/10.1142/S0218195914600085</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0218195914600085" target="_blank" >10.1142/S0218195914600085</a>

Result language

angličtina

Original language name

Terrain visibility with multiple viewpoints

Original language description

We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider a triangulated terrain with m>1 viewpoints (or guards) located on the terrain surface. A point on the terrain is considered visible if it has anunobstructed line of sight to at least one viewpoint. We study several natural and fundamental visibility structures: (1) the visibility map, which is a partition of the terrain into visible and invisible regions; (2) the colored visibility map, which is a partition of the terrain into regions whose points have exactly the same visible viewpoints; and (3) the Voronoi visibility map, which is a partition of the terrain into regions whose points have the same closest visible viewpoint. We study the complexity of each structure for both 1.5D and 2.5D terrains, and provide efficient algorithms to construct them. Our algorithm for the visibility map in 2.5D terrains improves on the only existing algorithm in this setting. To the best of our

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/EE2.3.30.0038" target="_blank" >EE2.3.30.0038: New excellence in human resources</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2014

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY &amp; APPLICATIONS

ISSN

0218-1959

e-ISSN

—

Volume of the periodical

24

Issue of the periodical within the volume

4

Country of publishing house

SG - SINGAPORE

Number of pages

32

Pages from-to

275-306

UT code for WoS article

—

EID of the result in the Scopus database

—