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

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

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://purl.org/net/nknouf/ns/bibtex#
n8http://localhost/temp/predkladatel/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/ontology/domain/vavai/
n20http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F03%3A00008369%21RIV08-MSM-14330___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://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/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F03%3A00008369%21RIV08-MSM-14330___
rdf:type
n13:Vysledek skos:Concept
dcterms:description
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for such settings, which support design of effective algorithms. We extend the existing the de Berg hierarchy of classes by the definition of new classes derived from that one and we show desirability of such an extension. Moreover we propose a new algorithm, which works on generalized $\lambda$-low density scenes (defined in this paper) and provides BSP tree of linear size. The tree can be constructed in $O(n \log^2 n)$ time and space, where n is the number of objects. Moreover, we can trade-off between size and balance of the BSP tree fairly simply. We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for such settings, which support design of effective algorithms. We extend the existing the de Berg hierarchy of classes by the definition of new classes derived from that one and we show desirability of such an extension. Moreover we propose a new algorithm, which works on generalized $\lambda$-low density scenes (defined in this paper) and provides BSP tree of linear size. The tree can be constructed in $O(n \log^2 n)$ time and space, where n is the number of objects. Moreover, we can trade-off between size and balance of the BSP tree fairly simply. We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for such settings, which support design of effective algorithms. We extend the existing the de Berg hierarchy of classes by the definition of new classes derived from that one and we show desirability of such an extension. Moreover we propose a new algorithm, which works on generalized $\lambda$-low density scenes (defined in this paper) and provides BSP tree of linear size. The tree can be constructed in $O(n \log^2 n)$ time and space, where n is the number of objects. Moreover, we can trade-off between size and balance of the BSP tree fairly simply.
dcterms:title
Linear Binary Space Partitions and the Hierarchy of Object Classes Linear Binary Space Partitions and the Hierarchy of Object Classes Linear Binary Space Partitions and the Hierarchy of Object Classes
skos:prefLabel
Linear Binary Space Partitions and the Hierarchy of Object Classes Linear Binary Space Partitions and the Hierarchy of Object Classes Linear Binary Space Partitions and the Hierarchy of Object Classes
skos:notation
RIV/00216224:14330/03:00008369!RIV08-MSM-14330___
n4:strany
64-67
n4:aktivita
n18:P n18:Z
n4:aktivity
P(GV201/98/K041), Z(MSM 143300003)
n4:dodaniDat
n7:2008
n4:domaciTvurceVysledku
n11:5364892 n11:1689126
n4:druhVysledku
n12:D
n4:duvernostUdaju
n19:S
n4:entitaPredkladatele
n21:predkladatel
n4:idSjednocenehoVysledku
613601
n4:idVysledku
RIV/00216224:14330/03:00008369
n4:jazykVysledku
n14:eng
n4:klicovaSlova
BSP; Tree; Partitioning; Object; Class; Hierarchy
n4:klicoveSlovo
n5:Object n5:BSP n5:Class n5:Hierarchy n5:Partitioning n5:Tree
n4:kontrolniKodProRIV
[62EEB388624E]
n4:mistoKonaniAkce
Halifax
n4:mistoVydani
Halifax, Canada
n4:nazevZdroje
Abstracts for the 15th Canadian Conference on Computational Geometry
n4:obor
n9:IN
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:projekt
n15:GV201%2F98%2FK041
n4:rokUplatneniVysledku
n7:2003
n4:tvurceVysledku
Tobola, Petr Nechvíle, Karel
n4:typAkce
n16:WRD
n4:zahajeniAkce
2003-01-01+01:00
n4:zamer
n20:MSM%20143300003
s:numberOfPages
4
n17:hasPublisher
Dalhousie University
n8:organizacniJednotka
14330