Linear BSP trees for sets of hyperrectangles with low directional density

dc.contributor.authorTobola, Petr
dc.contributor.authorNechvíle, Karel
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-21T08:05:39Z
dc.date.available2015-09-21T08:05:39Z
dc.date.issued2001
dc.description.abstract-translatedWe 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 ful lls the low directional density condition de ned in this paper then the resultant BSP has O(n) size and it can be constructed in O(n log2 n) time in R3 . The low directional density condition de nes 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
dc.format8 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationJournal of WSCG. 2001, vol. 9, no. 1-3.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.identifier.urihttp://hdl.handle.net/11025/15784
dc.identifier.urihttp://wscg.zcu.cz/wscg2001/WSCG2001_Program.htm
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.rights.accessopenAccessen
dc.subjectBSPcs
dc.subjectdělenícs
dc.subjecthyperobdélníkcs
dc.subject.translatedBSPen
dc.subject.translatedpartitioningen
dc.subject.translatedhyperrectangleen
dc.titleLinear BSP trees for sets of hyperrectangles with low directional densityen
dc.typečlánekcs
dc.typearticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Original bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
R321.pdf
Size:
243.93 KB
Format:
Adobe Portable Document Format
Description:
Plný text
License bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: