|
 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • |
All
Nearest Neighbors
|
|
|
|
– |
Given
a set of points in the
|
|
|
|
plane,
report a nearest-
|
|
|
|
neighbor
for each point
|
|
|
| • |
Closest
Pair
|
|
|
|
– |
Given
a set of n points in
|
|
|
|
the
plane, which two points
|
|
|
|
are the
closest?
|
|
|
| • |
Euclidean
MST
|
|
|
|
– |
Given
n points in the plane,
|
|
|
find
the Minimum Spanning
|
|
|
Tree of
the complete
|
|
|
|
(Euclidean)
graph
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • |
Triangulation
|
|
|
|
– |
Given n
points in the plane,
|
|
|
|
find a
triangulation of these
|
|
|
|
points
|
|
|
| • |
Sorting
|
|
|
|
– |
Given a
set of n numbers,
|
|
|
|
report
the numbers in order
|
|
|
| • |
Element
Uniqueness
|
|
|
|
– |
Given a
set of n numbers,
|
|
|
|
are
the numbers all distinct?
|
|
This
set of problems is from [Preparata
|
|
|
&
Shamos]
|
|
|
|