Algorithms for Solving Near Point Problems

Near point problems are widely used in computational geometry as well as a variety of other scientific fields. This work examines four common near point problems and presents original algorithms that solve them. Planar nearest neighbor searching is highly motivated by geographic information system a...

Full description

Bibliographic Details
Other Authors: Connor, Michael (authoraut)
Format: Others
Language:English
English
Published: Florida State University
Subjects:
Online Access:http://purl.flvc.org/fsu/fd/FSU_migr_etd-3440