/* * 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/. * * Copyright 2015-2018 Danny Robson */ #pragma once #include "../point.hpp" #include "../vector.hpp" #include "../matrix.hpp" namespace util::geom { /// represents an S dimensional plane in parametric form: ax + by + cz + d = 0 template struct plane { plane () = default; plane (util::point base, util::vector normal); explicit plane (util::vector _coefficients): coefficients (_coefficients) { ; } util::vector coefficients; }; typedef plane<2,float> plane2f; typedef plane<3,float> plane3f; inline plane3f make_plane (util::point3f a, util::point3f b, util::point3f c) { return plane3f (a, normalised (cross (b - a, c - a))); } /////////////////////////////////////////////////////////////////////////// /// returns the normal for a plane template util::vector normal (plane p) { return p.coefficients.template redim (); } /////////////////////////////////////////////////////////////////////////// /// normalises a plane's parametric form /// /// useful only after manually modifying the coefficients (as in default /// construction and piecewise initialisation). a plane will otherwise be /// assumed to be in normal form. template plane normalised (plane p) { const auto mag = norm (normal (p)); CHECK_NEZ (mag); return plane (p.coefficients / mag); } /////////////////////////////////////////////////////////////////////////// /// calculates the distance from a plane to a point. /// /// positive distances are in front of the plane, negative is behind; /// /// NOTE: `distance2` is _not_ the squared distance. It is the /// unnormalised distance. It needs to be divided by the norm of the /// plane normal. template T distance2 (plane p, point q) { return dot (p.coefficients, q.template redim (1)); } template T distance2 (point p, plane q) { return -distance2 (q, p); } template T distance (plane p, point q) { return distance2 (p, q) / norm (normal (p)); } template T distance (point p, plane q) { return -distance (q, p); } /////////////////////////////////////////////////////////////////////////// template auto furthest (plane p, const std::vector> &cloud) { T maxd = -INFINITY; auto best = cloud.begin (); for (auto q = cloud.begin (), last = cloud.end (); q != last; ++q) { if (auto d = distance (p, *q); d > maxd) { maxd = d; best = q; } } return std::make_tuple (best, maxd); } template auto furthest (plane, std::vector> &&) = delete; }