closestpair.hpp File Reference

Closest pair of points by divide and conquer. More...

#include "algorithm/mindisk.hpp"
#include <algorithm>
#include <cassert>
#include <cstddef>
#include <iterator>
#include <type_traits>
#include <utility>
#include <vector>

Go to the source code of this file.

Namespaces
namespace	pgl

Functions
template<class Container>
Segment< detail::closest_pair_input_point_t< Container > >	pgl::closestPair (const Container &input)
	Computes a closest pair of points by divide and conquer.

Detailed Description

Closest pair of points by divide and conquer.

Algorithm headers sit above the shape API and express reusable geometry procedures in terms of the public primitives.