About: Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density     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)

AttributesValues
rdf:type
Description
  • We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrectangles in space with constant dimension. If the set S fulfills the low directional density condition defined in this paper then the resultant BSP has O(n) size and it can be constructed effectively. The low directional density condition defines a new class of objects which we are able to construct a linear BSP for. The method is quite simple and it should be appropriate for practical implementation.
  • We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrectangles in space with constant dimension. If the set S fulfills the low directional density condition defined in this paper then the resultant BSP has O(n) size and it can be constructed effectively. The low directional density condition defines a new class of objects which we are able to construct a linear BSP for. The method is quite simple and it should be appropriate for practical implementation. (en)
Title
  • Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density
  • Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density (en)
skos:prefLabel
  • Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density
  • Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density (en)
skos:notation
  • RIV/00216224:14330/01:00005213!RIV/2002/GA0/143302/N
http://linked.open.../vavai/riv/strany
  • 237
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GV201/98/K041), Z(MSM 143300003)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 685352
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/01:00005213
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • BSP, partitioning, hyperrectangle (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [B8A0EE1788E7]
http://linked.open...v/mistoKonaniAkce
  • Plzen
http://linked.open...i/riv/mistoVydani
  • Plzen
http://linked.open...i/riv/nazevZdroje
  • WSCG' 2001, Conference proceedings
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...ocetUcastnikuAkce
http://linked.open...nichUcastnikuAkce
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Nechvíle, Karel
  • Tobola, Petr
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Západočeská univerzita v Plzni
https://schema.org/isbn
  • 80-7082-712-4
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software