This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21260%2F03%3A03089075%21RIV%2F2004%2FMSM%2F212604%2FN/
n13http://localhost/temp/predkladatel/
n7http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21260%2F03%3A03089075%21RIV%2F2004%2FMSM%2F212604%2FN
rdf:type
skos:Concept n12:Vysledek
dcterms: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. 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.
dcterms:title
Exact Regional Visibility Using Line Space Partitioning Exact Regional Visibility Using Line Space Partitioning
skos:prefLabel
Exact Regional Visibility Using Line Space Partitioning Exact Regional Visibility Using Line Space Partitioning
skos:notation
RIV/68407700:21260/03:03089075!RIV/2004/MSM/212604/N
n5:strany
569 ; 580
n5:aktivita
n18:Z
n5:aktivity
Z(MSM 210000023)
n5:cisloPeriodika
4
n5:dodaniDat
n11:2004
n5:domaciTvurceVysledku
n7:1257072 n7:9264388 n7:1077163
n5:druhVysledku
n9:J
n5:duvernostUdaju
n6:S
n5:entitaPredkladatele
n16:predkladatel
n5:idSjednocenehoVysledku
606577
n5:idVysledku
RIV/68407700:21260/03:03089075
n5:jazykVysledku
n14:eng
n5:klicovaSlova
Geometric algorithms;Spatial hierarchies;Visible surface algorithms
n5:klicoveSlovo
n10:Geometric%20algorithms n10:Spatial%20hierarchies n10:Visible%20surface%20algorithms
n5:kodStatuVydavatele
GB - Spojené království Velké Británie a Severního Irska
n5:kontrolniKodProRIV
[8B61532B5E45]
n5:nazevZdroje
Computers & Graphics
n5:obor
n8:JD
n5:pocetDomacichTvurcuVysledku
3
n5:pocetTvurcuVysledku
3
n5:rokUplatneniVysledku
n11:2003
n5:svazekPeriodika
27
n5:tvurceVysledku
Přikryl, Jan Slavík, Pavel Bittner, Jiří
n5:zamer
n17:MSM%20210000023
s:issn
0097-8930
s:numberOfPages
12
n13:organizacniJednotka
21260