Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Computer Science Teaching Center >
Computer Science Teaching Center >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/57

Title: PR k-d Tree Demo
Authors: Brabec, Frantisek
Samet, Hanan
Keywords: Data sub_subject: Data Structures,k-d, k-d tree, PR k-d tree, tree, visualization
Issue Date: 23-Mar-2001
Publisher: University of Maryland
Abstract: Recursively decompose the underlying space into two equal area blocks until each block contains at most one data point. The partition axes are cycled in the order x , y , x , y , ... The partition positions are independent of the data.
URI: http://www.citidel.org/handle/10117/57
Other Identifiers: 123
Appears in Collections:Computer Science Teaching Center

Files in This Item:

File Description SizeFormat
CSTC.URL.985379607.description0KbUnknownView/Open
abstract.txt0KbTextView/Open
dublin_core.xml1KbXMLView/Open
metadata.txt1KbTextView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback