half_plane_intersection.hpp¶
求若干有向直线左侧半平面的交集多边形，并处理空集或无界情况。
Complexity: Time: O(n log n). Space: O(n).
Implementation¶
当前头文件，省略 include guard；依赖见 #include。
/// @complexity Time: O(n log n).
/// Space: O(n).
#include "noya/geometry_base.hpp"
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <optional>
#include <vector>
namespace noya {
/// @brief Directed boundary whose feasible half-plane is on its left side.
struct half_plane {
point<long double> o;
point<long double> dir;
half_plane() = default;
half_plane(point<long double> u, point<long double> to) : o(u), dir(to - u) {
assert(norm2(dir) > 0);
}
bool contains(const point<long double> &val, long double eps = 1e-12L) const {
return cross(dir, val - o) >= -eps;
}
};
namespace half_plane_internal {
inline int direction_half(const point<long double> &dir) {
return dir.y > 0 || (dir.y == 0 && dir.x >= 0) ? 0 : 1;
}
inline bool direction_less(const half_plane &l, const half_plane &r) {
int hl = direction_half(l.dir);
int hr = direction_half(r.dir);
if (hl != hr) {
return hl < hr;
}
long double prd = cross(l.dir, r.dir);
if (prd != 0) {
return prd > 0;
}
if (l.o.x != r.o.x) {
return l.o.x < r.o.x;
}
return l.o.y < r.o.y;
}
inline bool same_direction(const half_plane &l, const half_plane &r,
long double eps) {
return std::abs(cross(l.dir, r.dir)) <= eps && dot(l.dir, r.dir) > 0;
}
inline std::optional<point<long double>>
boundary_intersection(const half_plane &l, const half_plane &r,
long double eps) {
long double den = cross(l.dir, r.dir);
if (std::abs(den) <= eps) {
return std::nullopt;
}
long double rat = cross(r.o - l.o, r.dir) / den;
return l.o + l.dir * rat;
}
} // namespace half_plane_internal
/// @brief Return the counter-clockwise polygon of a nonempty bounded
/// half-plane pt. Empty and unbounded intersections return {}.
inline std::vector<point<long double>>
half_plane_intersection(std::vector<half_plane> hps, long double eps = 1e-12L) {
using half_plane_internal::boundary_intersection;
using half_plane_internal::same_direction;
std::sort(hps.begin(), hps.end(), half_plane_internal::direction_less);
std::vector<half_plane> uni;
for (const half_plane &cur : hps) {
if (!uni.empty() && same_direction(uni.back(), cur, eps)) {
if (uni.back().contains(cur.o, eps)) {
uni.back() = cur;
}
} else {
uni.push_back(cur);
}
}
std::deque<half_plane> dq;
for (const half_plane &cur : uni) {
while (dq.size() >= 2) {
auto pt = boundary_intersection(dq[dq.size() - 2], dq.back(), eps);
if (pt && cur.contains(*pt, eps)) {
break;
}
dq.pop_back();
}
while (dq.size() >= 2) {
auto pt = boundary_intersection(dq[0], dq[1], eps);
if (pt && cur.contains(*pt, eps)) {
break;
}
dq.pop_front();
}
dq.push_back(cur);
}
while (dq.size() >= 3) {
auto pt = boundary_intersection(dq[dq.size() - 2], dq.back(), eps);
if (pt && dq.front().contains(*pt, eps)) {
break;
}
dq.pop_back();
}
while (dq.size() >= 3) {
auto pt = boundary_intersection(dq[0], dq[1], eps);
if (pt && dq.back().contains(*pt, eps)) {
break;
}
dq.pop_front();
}
if (dq.size() < 3) {
return {};
}
std::vector<point<long double>> pg;
for (int i = 0; i < int(dq.size()); i++) {
auto pt = boundary_intersection(dq[i], dq[(i + 1) % dq.size()], eps);
if (!pt) {
return {};
}
pg.push_back(*pt);
}
for (const point<long double> &val : pg) {
for (const half_plane &hp : uni) {
if (!hp.contains(val, eps * 16)) {
return {};
}
}
}
if (std::abs(polygon_area2(pg)) <= eps) {
return {};
}
return pg;
}
} // namespace noya
#ifndef NOYA_HALF_PLANE_INTERSECTION_HPP
#define NOYA_HALF_PLANE_INTERSECTION_HPP 1
/// @complexity Time: O(n log n).
/// Space: O(n).
#include "noya/geometry_base.hpp"
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <optional>
#include <vector>
namespace noya {
/// @brief Directed boundary whose feasible half-plane is on its left side.
struct half_plane {
point<long double> o;
point<long double> dir;
half_plane() = default;
half_plane(point<long double> u, point<long double> to) : o(u), dir(to - u) {
assert(norm2(dir) > 0);
}
bool contains(const point<long double> &val, long double eps = 1e-12L) const {
return cross(dir, val - o) >= -eps;
}
};
namespace half_plane_internal {
inline int direction_half(const point<long double> &dir) {
return dir.y > 0 || (dir.y == 0 && dir.x >= 0) ? 0 : 1;
}
inline bool direction_less(const half_plane &l, const half_plane &r) {
int hl = direction_half(l.dir);
int hr = direction_half(r.dir);
if (hl != hr) {
return hl < hr;
}
long double prd = cross(l.dir, r.dir);
if (prd != 0) {
return prd > 0;
}
if (l.o.x != r.o.x) {
return l.o.x < r.o.x;
}
return l.o.y < r.o.y;
}
inline bool same_direction(const half_plane &l, const half_plane &r,
long double eps) {
return std::abs(cross(l.dir, r.dir)) <= eps && dot(l.dir, r.dir) > 0;
}
inline std::optional<point<long double>>
boundary_intersection(const half_plane &l, const half_plane &r,
long double eps) {
long double den = cross(l.dir, r.dir);
if (std::abs(den) <= eps) {
return std::nullopt;
}
long double rat = cross(r.o - l.o, r.dir) / den;
return l.o + l.dir * rat;
}
} // namespace half_plane_internal
/// @brief Return the counter-clockwise polygon of a nonempty bounded
/// half-plane pt. Empty and unbounded intersections return {}.
inline std::vector<point<long double>>
half_plane_intersection(std::vector<half_plane> hps, long double eps = 1e-12L) {
using half_plane_internal::boundary_intersection;
using half_plane_internal::same_direction;
std::sort(hps.begin(), hps.end(), half_plane_internal::direction_less);
std::vector<half_plane> uni;
for (const half_plane &cur : hps) {
if (!uni.empty() && same_direction(uni.back(), cur, eps)) {
if (uni.back().contains(cur.o, eps)) {
uni.back() = cur;
}
} else {
uni.push_back(cur);
}
}
std::deque<half_plane> dq;
for (const half_plane &cur : uni) {
while (dq.size() >= 2) {
auto pt = boundary_intersection(dq[dq.size() - 2], dq.back(), eps);
if (pt && cur.contains(*pt, eps)) {
break;
}
dq.pop_back();
}
while (dq.size() >= 2) {
auto pt = boundary_intersection(dq[0], dq[1], eps);
if (pt && cur.contains(*pt, eps)) {
break;
}
dq.pop_front();
}
dq.push_back(cur);
}
while (dq.size() >= 3) {
auto pt = boundary_intersection(dq[dq.size() - 2], dq.back(), eps);
if (pt && dq.front().contains(*pt, eps)) {
break;
}
dq.pop_back();
}
while (dq.size() >= 3) {
auto pt = boundary_intersection(dq[0], dq[1], eps);
if (pt && dq.back().contains(*pt, eps)) {
break;
}
dq.pop_front();
}
if (dq.size() < 3) {
return {};
}
std::vector<point<long double>> pg;
for (int i = 0; i < int(dq.size()); i++) {
auto pt = boundary_intersection(dq[i], dq[(i + 1) % dq.size()], eps);
if (!pt) {
return {};
}
pg.push_back(*pt);
}
for (const point<long double> &val : pg) {
for (const half_plane &hp : uni) {
if (!hp.contains(val, eps * 16)) {
return {};
}
}
}
if (std::abs(polygon_area2(pg)) <= eps) {
return {};
}
return pg;
}
} // namespace noya
#endif // NOYA_HALF_PLANE_INTERSECTION_HPP
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <optional>
#include <vector>
/// @complexity Time: O(n log n).
/// Space: O(n).
/// @complexity Time: O(1) per primitive; O(n log n) for convex hull.
/// Space: O(1) per primitive and O(n) for hull construction.
namespace noya {
/// @brief Two-dimensional point with vector arithmetic and lexicographic order.
template <class T> struct point {
T x{};
T y{};
point() = default;
point(T x_, T y_) : x(x_), y(y_) {}
point &operator+=(const point &rhs) {
x += rhs.x;
y += rhs.y;
return *this;
}
point &operator-=(const point &rhs) {
x -= rhs.x;
y -= rhs.y;
return *this;
}
point &operator*=(const T &scl) {
x *= scl;
y *= scl;
return *this;
}
point &operator/=(const T &scl) {
x /= scl;
y /= scl;
return *this;
}
friend point operator+(point l, const point &r) { return l += r; }
friend point operator-(point l, const point &r) { return l -= r; }
friend point operator*(point val, const T &scl) { return val *= scl; }
friend point operator*(const T &scl, point val) { return val *= scl; }
friend point operator/(point val, const T &scl) { return val /= scl; }
friend bool operator==(const point &, const point &) = default;
friend bool operator<(const point &l, const point &r) {
return l.x < r.x || (l.x == r.x && l.y < r.y);
}
};
/// @brief Circle represented by a center and a nonnegative radius.
template <class Real> struct circle {
point<Real> o;
Real r1{};
};
/// @brief Return the dot product of two vectors.
template <class T> T dot(const point<T> &a, const point<T> &b) {
return a.x * b.x + a.y * b.y;
}
/// @brief Return the signed cross product of two vectors.
template <class T> T cross(const point<T> &a, const point<T> &b) {
return a.x * b.y - a.y * b.x;
}
/// @brief Return cross(a - o1, b - o1).
template <class T>
T cross(const point<T> &o1, const point<T> &a, const point<T> &b) {
return cross(a - o1, b - o1);
}
/// @brief Return the squared Euclidean norm.
template <class T> T norm2(const point<T> &val) { return dot(val, val); }
/// @brief Compare a value with zero using an optional absolute tolerance.
template <class T> int sign(const T &val, const T &eps = T{}) {
return (val > eps) - (val < -eps);
}
/// @brief Return -1, 0, or 1 for a clockwise, collinear, or counter-clockwise
/// turn.
template <class T>
int orientation(const point<T> &a, const point<T> &b, const point<T> &c,
const T &eps = T{}) {
return sign(cross(a, b, c), eps);
}
/// @brief Test whether p lies on the closed segment [a, b].
template <class T>
bool on_segment(const point<T> &p, const point<T> &a, const point<T> &b,
const T &eps = T{}) {
if (orientation(a, b, p, eps) != 0) {
return false;
}
return std::min(a.x, b.x) - eps <= p.x && p.x <= std::max(a.x, b.x) + eps &&
std::min(a.y, b.y) - eps <= p.y && p.y <= std::max(a.y, b.y) + eps;
}
/// @brief Test whether the closed segments [a, b] and [c, d] intersect.
template <class T>
bool segments_intersect(const point<T> &a, const point<T> &b, const point<T> &c,
const point<T> &d, const T &eps = T{}) {
int s1 = orientation(a, b, c, eps);
int s2 = orientation(a, b, d, eps);
int s3 = orientation(c, d, a, eps);
int s4 = orientation(c, d, b, eps);
if (s1 == 0 && on_segment(c, a, b, eps)) {
return true;
}
if (s2 == 0 && on_segment(d, a, b, eps)) {
return true;
}
if (s3 == 0 && on_segment(a, c, d, eps)) {
return true;
}
if (s4 == 0 && on_segment(b, c, d, eps)) {
return true;
}
return s1 * s2 < 0 && s3 * s4 < 0;
}
/// @brief Intersect the infinite lines through (a, b) and (c, d), returning
/// nullopt when they are parallel or coincident.
template <class T>
std::optional<point<long double>>
line_intersection(const point<T> &a, const point<T> &b, const point<T> &c,
const point<T> &d, long double eps = 0) {
point<long double> lhs{static_cast<long double>(a.x),
static_cast<long double>(a.y)};
point<long double> b1{static_cast<long double>(b.x),
static_cast<long double>(b.y)};
point<long double> z{static_cast<long double>(c.x),
static_cast<long double>(c.y)};
point<long double> d1{static_cast<long double>(d.x),
static_cast<long double>(d.y)};
point<long double> da = b1 - lhs;
point<long double> db = d1 - z;
long double den = cross(da, db);
if (std::abs(den) <= eps) {
return std::nullopt;
}
long double rat = cross(z - lhs, db) / den;
return lhs + da * rat;
}
/// @brief Return the convex hull in counter-clockwise order without repetition.
template <class T>
std::vector<point<T>> convex_hull(std::vector<point<T>> pt, bool kc = false) {
std::sort(pt.begin(), pt.end());
pt.erase(std::unique(pt.begin(), pt.end()), pt.end());
if (pt.size() <= 1) {
return pt;
}
bool col = true;
for (int i = 2; i < int(pt.size()); i++) {
col &= orientation(pt[0], pt[1], pt[i]) == 0;
}
if (kc && col) {
return pt;
}
std::vector<point<T>> lo, hi;
for (const point<T> &p : pt) {
while (lo.size() >= 2) {
int rot = orientation(lo[lo.size() - 2], lo.back(), p);
if (rot > 0 || (kc && rot == 0)) {
break;
}
lo.pop_back();
}
lo.push_back(p);
}
for (auto it = pt.rbegin(); it != pt.rend(); ++it) {
while (hi.size() >= 2) {
int rot = orientation(hi[hi.size() - 2], hi.back(), *it);
if (rot > 0 || (kc && rot == 0)) {
break;
}
hi.pop_back();
}
hi.push_back(*it);
}
lo.pop_back();
hi.pop_back();
lo.insert(lo.end(), hi.begin(), hi.end());
return lo;
}
/// @brief Return twice the signed area of a polygon.
template <class T> T polygon_area2(const std::vector<point<T>> &pg) {
T res{};
for (int i = 0; i < int(pg.size()); i++) {
res += cross(pg[i], pg[(i + 1) % pg.size()]);
}
return res;
}
/// @brief Classify a point relative to a polygon: -1 outside, 0 boundary, 1
/// inside.
template <class T>
int point_in_polygon(const point<T> &p, const std::vector<point<T>> &pg) {
bool in = false;
for (int i = 0; i < int(pg.size()); i++) {
point<T> a = pg[i];
point<T> b = pg[(i + 1) % pg.size()];
if (on_segment(p, a, b)) {
return 0;
}
if (a.y <= p.y && p.y < b.y && orientation(a, b, p) > 0) {
in = !in;
}
if (b.y <= p.y && p.y < a.y && orientation(a, b, p) < 0) {
in = !in;
}
}
return in ? 1 : -1;
}
/// @brief Return the Euclidean distance between two points.
template <class T> long double distance(const point<T> &a, const point<T> &b) {
return std::hypot(
static_cast<long double>(a.x) - static_cast<long double>(b.x),
static_cast<long double>(a.y) - static_cast<long double>(b.y));
}
} // namespace noya
namespace noya {
/// @brief Directed boundary whose feasible half-plane is on its left side.
struct half_plane {
point<long double> o;
point<long double> dir;
half_plane() = default;
half_plane(point<long double> u, point<long double> to) : o(u), dir(to - u) {
assert(norm2(dir) > 0);
}
bool contains(const point<long double> &val, long double eps = 1e-12L) const {
return cross(dir, val - o) >= -eps;
}
};
namespace half_plane_internal {
inline int direction_half(const point<long double> &dir) {
return dir.y > 0 || (dir.y == 0 && dir.x >= 0) ? 0 : 1;
}
inline bool direction_less(const half_plane &l, const half_plane &r) {
int hl = direction_half(l.dir);
int hr = direction_half(r.dir);
if (hl != hr) {
return hl < hr;
}
long double prd = cross(l.dir, r.dir);
if (prd != 0) {
return prd > 0;
}
if (l.o.x != r.o.x) {
return l.o.x < r.o.x;
}
return l.o.y < r.o.y;
}
inline bool same_direction(const half_plane &l, const half_plane &r,
long double eps) {
return std::abs(cross(l.dir, r.dir)) <= eps && dot(l.dir, r.dir) > 0;
}
inline std::optional<point<long double>>
boundary_intersection(const half_plane &l, const half_plane &r,
long double eps) {
long double den = cross(l.dir, r.dir);
if (std::abs(den) <= eps) {
return std::nullopt;
}
long double rat = cross(r.o - l.o, r.dir) / den;
return l.o + l.dir * rat;
}
} // namespace half_plane_internal
/// @brief Return the counter-clockwise polygon of a nonempty bounded
/// half-plane pt. Empty and unbounded intersections return {}.
inline std::vector<point<long double>>
half_plane_intersection(std::vector<half_plane> hps, long double eps = 1e-12L) {
using half_plane_internal::boundary_intersection;
using half_plane_internal::same_direction;
std::sort(hps.begin(), hps.end(), half_plane_internal::direction_less);
std::vector<half_plane> uni;
for (const half_plane &cur : hps) {
if (!uni.empty() && same_direction(uni.back(), cur, eps)) {
if (uni.back().contains(cur.o, eps)) {
uni.back() = cur;
}
} else {
uni.push_back(cur);
}
}
std::deque<half_plane> dq;
for (const half_plane &cur : uni) {
while (dq.size() >= 2) {
auto pt = boundary_intersection(dq[dq.size() - 2], dq.back(), eps);
if (pt && cur.contains(*pt, eps)) {
break;
}
dq.pop_back();
}
while (dq.size() >= 2) {
auto pt = boundary_intersection(dq[0], dq[1], eps);
if (pt && cur.contains(*pt, eps)) {
break;
}
dq.pop_front();
}
dq.push_back(cur);
}
while (dq.size() >= 3) {
auto pt = boundary_intersection(dq[dq.size() - 2], dq.back(), eps);
if (pt && dq.front().contains(*pt, eps)) {
break;
}
dq.pop_back();
}
while (dq.size() >= 3) {
auto pt = boundary_intersection(dq[0], dq[1], eps);
if (pt && dq.back().contains(*pt, eps)) {
break;
}
dq.pop_front();
}
if (dq.size() < 3) {
return {};
}
std::vector<point<long double>> pg;
for (int i = 0; i < int(dq.size()); i++) {
auto pt = boundary_intersection(dq[i], dq[(i + 1) % dq.size()], eps);
if (!pt) {
return {};
}
pg.push_back(*pt);
}
for (const point<long double> &val : pg) {
for (const half_plane &hp : uni) {
if (!hp.contains(val, eps * 16)) {
return {};
}
}
}
if (std::abs(polygon_area2(pg)) <= eps) {
return {};
}
return pg;
}
} // namespace noya