Michael J. Radwin

Tales of a software engineer who keeps kosher and hates the web.

Priority search tree demo

Priority search tree demo was my final project for Brown’s Computational Geometry course. A priority search tree is a data structure that allows for efficient searching and point location in one and one-half dimensions (the upper bound on Y is missing). It is a hybrid of a heap and a balanced search tree (heap for y-coordinates, search tree for x-coordinates).