Show simple item record

dc.contributor.authorMurali, T. M.
dc.contributor.authorAgarwal, Pankaj K.
dc.contributor.authorVitter, Jeffrey Scott
dc.date.accessioned2011-03-21T20:30:12Z
dc.date.available2011-03-21T20:30:12Z
dc.date.issued1998
dc.identifier.citationT. M. Murali, P. K. Agarwal, and J. S. Vitter. “Constructing Binary Space Partitions for Orthogonal Rectangles in Practice,” Proceedings of the 6th Annual European Symposium on Algorithms (ESA ’98), Venice, August 1998, published in Lecture Notes in Computer Science, 1461, Springer, Berlin, Germany, 211–222. http://dx.doi.org/10.1007/3-540-68530-8_18
dc.identifier.urihttp://hdl.handle.net/1808/7226
dc.descriptionThe original publication is available at www.springerlink.com
dc.description.abstractIn this paper, we develop a simple technique for constructing a I3inary Space Partition (nSP) for a set of orthogonal rectangles in IR3. OUf algorithm has the novel feature that it tunes its performance to the geometric properties of the rectangles, e.g., their aspect ratios. "Fe have implemented our algorithm and tested its performance on real data scti). V\.Tc have also systematically compared the performance of our algorithm with that of other techniques presented in the literature. Our studies show that our algorithm constructs nsps of near-linear size and small height in practice, has fast running times, and answers queries efficiently. It is a method of choice for constructing BSPs for orthogonal rectangles.
dc.language.isoen_US
dc.publisherSpringer Verlag
dc.titleConstructing Binary Space Partitions for Orthogonal Rectangles in Practice
dc.typeArticle
kusw.kuauthorVitter, Jeffrey Scott
kusw.oastatusfullparticipation
dc.identifier.doi10.1007/3-540-68530-8_18
kusw.oaversionScholarly/refereed, author accepted manuscript
kusw.oapolicyThis item meets KU Open Access policy criteria.
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record