# Describe an O(n log n)-time algorithm for finding the second closest pair of points in a set, S, of n points in the plane. That is, you should return the pair, (p, q), in S, such that the only pair of points that could be closer to each other than the distance between p and q is the closest pair

Chapter 22, Creativity #15

Describe an O(n log n)-time algorithm for finding the second closest pair of points in a set, S, of n points in the plane. That is, you should return the pair, (p, q), in S, such that the only pair of points that could be closer to each other than the distance between p and q is the closest pair of points in S.

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

## Algorithm Design And Applications

1st Edition

**Authors:** Michael T. Goodrich, Roberto Tamassia

**ISBN:** 9781118335918