About: Linear Binary Space Partitions and the Hierarchy of Object Classes

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Linear Binary Space Partitions and the Hierarchy of Object Classes Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en) 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. (cs)
Title	Linear Binary Space Partitions and the Hierarchy of Object Classes Linear Binary Space Partitions and the Hierarchy of Object Classes (en) Linear Binary Space Partitions and the Hierarchy of Object Classes (cs)
skos:prefLabel	Linear Binary Space Partitions and the Hierarchy of Object Classes Linear Binary Space Partitions and the Hierarchy of Object Classes (en) Linear Binary Space Partitions and the Hierarchy of Object Classes (cs)
skos:notation	RIV/00216224:14330/03:00008369!RIV08-MSM-14330___
http://linked.open.../vavai/riv/strany	64-67
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GV201/98/K041), Z(MSM 143300003)
http://linked.open...vai/riv/dodaniDat	2008
http://linked.open...aciTvurceVysledku	Tobola, Petr Nechvíle, Karel
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	613601
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/03:00008369
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	BSP; Tree; Partitioning; Object; Class; Hierarchy (en)
http://linked.open.../riv/klicoveSlovo	Hierarchy Tree Object BSP Class Partitioning
http://linked.open...ontrolniKodProRIV	[62EEB388624E]
http://linked.open...v/mistoKonaniAkce	Halifax
http://linked.open...i/riv/mistoVydani	Halifax, Canada
http://linked.open...i/riv/nazevZdroje	Abstracts for the 15th Canadian Conference on Computational Geometry
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	HCILAB - human - computer interactions laboratory
http://linked.open...UplatneniVysledku	2003
http://linked.open...iv/tvurceVysledku	Nechvíle, Karel Tobola, Petr
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2003-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20143300003
number of pages	4 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Dalhousie University
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software