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/58

Title: PR Quadtree Demo
Authors: Samet, Hanan
Brabec, Frantisek
Keywords: Data sub_subject: Data Structures,tree, quadtree, visualization
Issue Date: 9-Nov-2001
Publisher: University of Maryland
Abstract: Recursively decompose the underlying space into four equal area blocks until each block contains at most one data point. The partition positions are independent of the data.
URI: http://www.citidel.org/handle/10117/58
Other Identifiers: 124
Appears in Collections:Computer Science Teaching Center

Files in This Item:

File Description SizeFormat
CSTC.URL.985379819.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