##
1.1.6 Kd-Trees

##
INPUT OUTPUT

**
Input Description:
**
A set
*
S
*
of
*
n
*
points in
*
k
*
-dimensions.
**
Problem:
**
Construct a tree which partitions the space by half-planes
such that each point is contained in it is own region.

##
Implementations

Ranger - Nearest Neighbor Search in Higher Dimensions (C) (rating 8)

Handbook of Algorithms and Data Structures (Pascal) (rating 3)

DIMACS Implementation Challenges (FORTRAN) (rating 1)

##
Related Problems

Nearest Neighbor Search

Point Location

Range Search

Go to the corresponding chapter in the book

About the Book

Send us Mail

Go to Main Page

This page last modified on Tue Jun 03, 1997
.