2015-10-14 15:32:53 +11:00
|
|
|
/*
|
2018-08-04 15:14:06 +10:00
|
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
2015-10-14 15:32:53 +11:00
|
|
|
*
|
2018-04-16 15:58:13 +10:00
|
|
|
* Copyright 2015-2018 Danny Robson <danny@nerdcruft.net>
|
2015-10-14 15:32:53 +11:00
|
|
|
*/
|
|
|
|
|
2018-11-26 14:08:50 +11:00
|
|
|
#pragma once
|
2015-10-14 15:32:53 +11:00
|
|
|
|
2017-08-29 12:21:03 +10:00
|
|
|
#include "./fwd.hpp"
|
2015-10-14 15:32:53 +11:00
|
|
|
#include "../point.hpp"
|
|
|
|
|
2018-04-16 15:58:13 +10:00
|
|
|
#include <type_traits>
|
|
|
|
|
2017-01-05 15:06:49 +11:00
|
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
2018-08-05 14:42:02 +10:00
|
|
|
namespace cruft::geom {
|
2018-11-26 14:08:50 +11:00
|
|
|
/// Tests whether any part of two shapes overlap.
|
|
|
|
///
|
|
|
|
/// Returns true even if the the edges of the shapes are co-linear.
|
2015-10-14 15:32:53 +11:00
|
|
|
template <
|
|
|
|
size_t S,
|
|
|
|
typename T,
|
|
|
|
template <size_t,typename> class A,
|
|
|
|
template <size_t,typename> class B
|
|
|
|
>
|
|
|
|
bool
|
|
|
|
intersects (A<S,T>, B<S,T>);
|
|
|
|
|
2018-11-26 14:08:50 +11:00
|
|
|
|
|
|
|
/// Returns a minimum squared distance between two shapes.
|
2015-10-14 15:32:53 +11:00
|
|
|
template <
|
|
|
|
size_t S,
|
|
|
|
typename T,
|
|
|
|
template <size_t,typename> class A,
|
|
|
|
template <size_t,typename> class B
|
|
|
|
>
|
|
|
|
T
|
|
|
|
distance2 (A<S,T>, B<S,T>);
|
|
|
|
|
2018-04-16 15:58:13 +10:00
|
|
|
// disable distance for point-point arguments given it's already
|
|
|
|
// explicitly specified in the point header.
|
2015-10-14 15:32:53 +11:00
|
|
|
template <
|
|
|
|
size_t S,
|
|
|
|
typename T,
|
|
|
|
template <size_t,typename> class A,
|
2018-04-16 15:58:13 +10:00
|
|
|
template <size_t,typename> class B,
|
|
|
|
typename = std::enable_if_t<
|
2018-08-05 14:42:02 +10:00
|
|
|
!std::is_same_v<cruft::point<S,T>, A> &&
|
|
|
|
!std::is_same_v<cruft::point<S,T>, B>
|
2018-04-16 15:58:13 +10:00
|
|
|
>
|
2015-10-14 15:32:53 +11:00
|
|
|
>
|
|
|
|
T
|
|
|
|
distance (A<S,T>, B<S,T>);
|
|
|
|
|
2018-11-26 14:08:50 +11:00
|
|
|
|
|
|
|
/// Returns an AABB for the supplied shape.
|
2015-10-14 15:32:53 +11:00
|
|
|
template <
|
|
|
|
size_t S,
|
|
|
|
typename T,
|
|
|
|
template <size_t,typename> class K
|
|
|
|
>
|
2017-08-24 16:43:54 +10:00
|
|
|
aabb<S,T>
|
2015-10-14 15:32:53 +11:00
|
|
|
bounds (K<S,T>);
|
|
|
|
|
2018-11-26 14:08:50 +11:00
|
|
|
|
2018-11-30 14:46:41 +11:00
|
|
|
/// Returns a bounding AABB for all supplied items
|
|
|
|
template <typename... Args>
|
|
|
|
auto
|
|
|
|
bounds (Args &&...args)
|
|
|
|
{
|
|
|
|
return (bounds (args) | ...);
|
|
|
|
}
|
|
|
|
|
2018-11-26 14:08:50 +11:00
|
|
|
/// Returns a maximum distance across a shape.
|
2015-10-14 15:32:53 +11:00
|
|
|
template <
|
|
|
|
size_t S,
|
|
|
|
typename T,
|
|
|
|
template <size_t,typename> class K
|
|
|
|
>
|
|
|
|
T
|
|
|
|
diameter (K<S,T>);
|
|
|
|
|
2018-11-26 14:08:50 +11:00
|
|
|
|
|
|
|
/// Returns the closest point on a shape to the supplied point.
|
2015-10-14 15:32:53 +11:00
|
|
|
template <
|
|
|
|
size_t S,
|
|
|
|
typename T,
|
|
|
|
template <size_t,typename> class K
|
|
|
|
>
|
|
|
|
point<S,T>
|
|
|
|
closest (K<S,T>, point<S,T>);
|
|
|
|
|
2018-11-26 14:08:50 +11:00
|
|
|
|
2015-10-14 15:32:53 +11:00
|
|
|
template <
|
|
|
|
size_t S,
|
|
|
|
typename T,
|
|
|
|
template <size_t,typename> class K
|
|
|
|
>
|
|
|
|
vector<S,T>
|
|
|
|
magnitude (K<S,T>);
|
|
|
|
|
2018-11-26 14:08:50 +11:00
|
|
|
|
2015-10-14 15:32:53 +11:00
|
|
|
template <
|
|
|
|
size_t S,
|
|
|
|
typename T,
|
|
|
|
template <size_t,typename> class K
|
|
|
|
>
|
|
|
|
K<S,T>
|
|
|
|
scale (K<S,T>, T);
|
2017-01-05 15:06:49 +11:00
|
|
|
}
|