This HTML5 document contains 45 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/
n13http://localhost/temp/predkladatel/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/ontology/domain/vavai/
n8http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F03%3A03089075%21RIV07-MSM-21230___/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F03%3A03089075%21RIV07-MSM-21230___
rdf:type
skos:Concept n10: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. Není k dispozici
dcterms:title
Není k dispozici 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 Není k dispozici
skos:notation
RIV/68407700:21230/03:03089075!RIV07-MSM-21230___
n3:strany
569;580
n3:aktivita
n15:Z
n3:aktivity
Z(MSM 212300014)
n3:cisloPeriodika
4
n3:dodaniDat
n14:2007
n3:domaciTvurceVysledku
n4:1077163 n4:9264388 n4:1257072
n3:druhVysledku
n18:J
n3:duvernostUdaju
n12:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
606576
n3:idVysledku
RIV/68407700:21230/03:03089075
n3:jazykVysledku
n5:eng
n3:klicovaSlova
Geometric algorithms; Spatial hierarchies; Visible surface algorithms
n3:klicoveSlovo
n6:Visible%20surface%20algorithms n6:Spatial%20hierarchies n6:Geometric%20algorithms
n3:kodStatuVydavatele
GB - Spojené království Velké Británie a Severního Irska
n3:kontrolniKodProRIV
[C157ADB91E96]
n3:nazevZdroje
Computers & Graphics
n3:obor
n17:JD
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n14:2003
n3:svazekPeriodika
27
n3:tvurceVysledku
Slavík, Pavel Přikryl, Jan Bittner, Jiří
n3:zamer
n8:MSM%20212300014
s:issn
0097-8493
s:numberOfPages
12
n13:organizacniJednotka
21230