CGAL 6.3 - dD Spatial Searching
Loading...
Searching...
No Matches
Reference Manual

Hans Tangelder and Andreas Fabri
This package implements exact and approximate distance browsing by providing exact and approximate algorithms for range searching, k-nearest and k-furthest neighbor searching, as well as incremental nearest and incremental furthest neighbor searching, where the query items are points in dD Euclidean space.
Introduced in: CGAL 3.0
BibTeX: cgal:tf-ssd-26a
License: GPL
Windows Demo: 2D Spatial Searching

This package provides data structures and algorithms for exact and approximate distance browsing, supporting

  • both nearest and furthest neighbor searching,
  • both exact and approximate searching,
  • (approximate) range searching,
  • (approximate) k-nearest and k-furthest neighbor searching,
  • (approximate) incremental nearest and incremental furthest neighbor searching,
  • query items representing points and spatial objects.

The spatial searching package consists of the following concepts and classes that are described in the reference pages.

Classified Reference Pages

Search Classes

Range Query Item Classes

Search Traits Classes

Distance Classes

Splitter Classes

Advanced Classes

Concepts

Topics

 Concepts
 Search Classes
 Range Query Item Classes
 Search Traits Classes
 Distance Classes
 Splitter Classes
 Advanced Classes