Exact Regional Visibility Using Line Space Partitioning

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A03089075" target="_blank" >RIV/68407700:21230/03:03089075 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Exact Regional Visibility Using Line Space Partitioning

Original language description

We present a new method for computing visibility from a polygonal region in the plane considering a set of line segments as occluders. The proposed method provides a comprehensive description of visibility from the given region. We represent sets of occluded rays using a hierarchical partitioning of dual space (line space). The line space partitioning is maintained by a BSP tree that provides efficient operations on the sets of lines. The implementation shows that the method is suitable for computing potentially visible sets in large scenes with various visibility characteristics.

Czech name

Není k dispozici

Czech description

Není k dispozici

Type

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

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2003

Confidentiality

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

Name of the periodical

Computers & Graphics

ISSN

0097-8493

e-ISSN

—

Volume of the periodical

27

Issue of the periodical within the volume

4

Country of publishing house

GB - UNITED KINGDOM

Number of pages

12

Pages from-to

569-580

UT code for WoS article

—

EID of the result in the Scopus database

—