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

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

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://purl.org/net/nknouf/ns/bibtex#
n13http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
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#
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F07%3A03138180%21RIV08-MSM-21230___/
n15http://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/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F07%3A03138180%21RIV08-MSM-21230___
rdf:type
n9:Vysledek skos:Concept
dcterms:description
We present a new method for integrating hierarchical levels of detail (HLOD) with occlusion culling. The algorithm refines the HLOD hierarchy using geometric criteria as well as the occlusion information. For the refinement we use a simple model which takes into account the possible distribution of the visible pixels. The traversal of the HLOD hierarchy is optimized by a new algorithm which uses spatial and temporal coherence of visibility. We predict the HLOD refinement condition for the current frame based on the results from the last frame. Prezentujeme novou metodu pro integraci hierarchických stupňů detailů (HLOD) za pomocí tzv. occlucion culling. We present a new method for integrating hierarchical levels of detail (HLOD) with occlusion culling. The algorithm refines the HLOD hierarchy using geometric criteria as well as the occlusion information. For the refinement we use a simple model which takes into account the possible distribution of the visible pixels. The traversal of the HLOD hierarchy is optimized by a new algorithm which uses spatial and temporal coherence of visibility. We predict the HLOD refinement condition for the current frame based on the results from the last frame.
dcterms:title
Optimized HLOD Refinement Driven by Hardware Occlusion Queries Optimalizované zjemňování HLOD založené na hardwarových dotazech zastínění Optimized HLOD Refinement Driven by Hardware Occlusion Queries
skos:prefLabel
Optimalizované zjemňování HLOD založené na hardwarových dotazech zastínění Optimized HLOD Refinement Driven by Hardware Occlusion Queries Optimized HLOD Refinement Driven by Hardware Occlusion Queries
skos:notation
RIV/68407700:21230/07:03138180!RIV08-MSM-21230___
n3:strany
106;117
n3:aktivita
n18:P
n3:aktivity
P(LC06008)
n3:dodaniDat
n5:2008
n3:domaciTvurceVysledku
n8:1257072
n3:druhVysledku
n14:D
n3:duvernostUdaju
n6:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
439922
n3:idVysledku
RIV/68407700:21230/07:03138180
n3:jazykVysledku
n10:eng
n3:klicovaSlova
HLOD; occlusion culling
n3:klicoveSlovo
n15:HLOD n15:occlusion%20culling
n3:kontrolniKodProRIV
[3C43C8A0DA1F]
n3:mistoKonaniAkce
Lake Tahoe
n3:mistoVydani
New York
n3:nazevZdroje
Advances in Visual Computing (Third International Symposium on Computer Vision -- ISVC 2007)
n3:obor
n4:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n16:LC06008
n3:rokUplatneniVysledku
n5:2007
n3:tvurceVysledku
Wimmer, M. Bittner, Jiří Charalambos, J. P.
n3:typAkce
n17:WRD
n3:zahajeniAkce
2007-11-26+01:00
s:numberOfPages
12
n20:hasPublisher
Springer-Verlag
n21:isbn
978-3-540-76857-9
n13:organizacniJednotka
21230