275 lines
11 KiB
C++
275 lines
11 KiB
C++
|
#ifndef OSMIUM_AREA_DETAIL_NODE_REF_SEGMENT_HPP
|
||
|
|
#define OSMIUM_AREA_DETAIL_NODE_REF_SEGMENT_HPP
|
||
|
|
|
||
|
|
/*
|
||
|
|
|
||
|
|
This file is part of Osmium (http://osmcode.org/libosmium).
|
||
|
|
|
||
|
|
Copyright 2013-2016 Jochen Topf <jochen@topf.org> and others (see README).
|
||
|
|
|
||
|
|
Boost Software License - Version 1.0 - August 17th, 2003
|
||
|
|
|
||
|
|
Permission is hereby granted, free of charge, to any person or organization
|
||
|
|
obtaining a copy of the software and accompanying documentation covered by
|
||
|
|
this license (the "Software") to use, reproduce, display, distribute,
|
||
|
|
execute, and transmit the Software, and to prepare derivative works of the
|
||
|
|
Software, and to permit third-parties to whom the Software is furnished to
|
||
|
|
do so, all subject to the following:
|
||
|
|
|
||
|
|
The copyright notices in the Software and this entire statement, including
|
||
|
|
the above license grant, this restriction and the following disclaimer,
|
||
|
|
must be included in all copies of the Software, in whole or in part, and
|
||
|
|
all derivative works of the Software, unless such copies or derivative
|
||
|
|
works are solely in the form of machine-executable object code generated by
|
||
|
|
a source language processor.
|
||
|
|
|
||
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||
|
|
FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
|
||
|
|
SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
|
||
|
|
FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
|
||
|
|
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
||
|
|
DEALINGS IN THE SOFTWARE.
|
||
|
|
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <algorithm>
|
||
|
|
#include <cstdint>
|
||
|
|
#include <cstring>
|
||
|
|
#include <iosfwd>
|
||
|
|
#include <utility>
|
||
|
|
|
||
|
|
#include <osmium/osm/location.hpp>
|
||
|
|
#include <osmium/osm/node_ref.hpp>
|
||
|
|
|
||
|
|
namespace osmium {
|
||
|
|
|
||
|
|
class Way;
|
||
|
|
|
||
|
|
namespace area {
|
||
|
|
|
||
|
|
/**
|
||
|
|
* @brief Namespace for Osmium internal use
|
||
|
|
*/
|
||
|
|
namespace detail {
|
||
|
|
|
||
|
|
/**
|
||
|
|
* This helper class for the Assembler class models a segment.
|
||
|
|
* Segments are the connection between
|
||
|
|
* two nodes and they all have their smaller coordinate at the
|
||
|
|
* beginning of the segment. Smaller, in this case, means smaller x
|
||
|
|
* coordinate, and if they are the same smaller y coordinate.
|
||
|
|
*/
|
||
|
|
class NodeRefSegment {
|
||
|
|
|
||
|
|
osmium::NodeRef m_first;
|
||
|
|
osmium::NodeRef m_second;
|
||
|
|
|
||
|
|
/// Role of the member this segment was from.
|
||
|
|
const char* m_role;
|
||
|
|
|
||
|
|
/// Way this segment was from.
|
||
|
|
const osmium::Way* m_way;
|
||
|
|
|
||
|
|
public:
|
||
|
|
|
||
|
|
void swap_locations() {
|
||
|
|
using std::swap;
|
||
|
|
swap(m_first, m_second);
|
||
|
|
}
|
||
|
|
|
||
|
|
explicit NodeRefSegment() noexcept :
|
||
|
|
m_first(),
|
||
|
|
m_second(),
|
||
|
|
m_role(nullptr),
|
||
|
|
m_way(nullptr) {
|
||
|
|
}
|
||
|
|
|
||
|
|
explicit NodeRefSegment(const osmium::NodeRef& nr1, const osmium::NodeRef& nr2, const char* role, const osmium::Way* way) :
|
||
|
|
m_first(nr1),
|
||
|
|
m_second(nr2),
|
||
|
|
m_role(role),
|
||
|
|
m_way(way) {
|
||
|
|
if (nr2.location() < nr1.location()) {
|
||
|
|
swap_locations();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
NodeRefSegment(const NodeRefSegment&) = default;
|
||
|
|
NodeRefSegment(NodeRefSegment&&) = default;
|
||
|
|
|
||
|
|
NodeRefSegment& operator=(const NodeRefSegment&) = default;
|
||
|
|
NodeRefSegment& operator=(NodeRefSegment&&) = default;
|
||
|
|
|
||
|
|
~NodeRefSegment() = default;
|
||
|
|
|
||
|
|
/// Return first NodeRef of Segment according to sorting order (bottom left to top right).
|
||
|
|
const osmium::NodeRef& first() const noexcept {
|
||
|
|
return m_first;
|
||
|
|
}
|
||
|
|
|
||
|
|
/// Return second NodeRef of Segment according to sorting order (bottom left to top right).
|
||
|
|
const osmium::NodeRef& second() const noexcept {
|
||
|
|
return m_second;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool to_left_of(const osmium::Location& location) const {
|
||
|
|
// std::cerr << "segment " << first() << "--" << second() << " to_left_of(" << location << "\n";
|
||
|
|
|
||
|
|
if (first().location() == location || second().location() == location) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
const std::pair<osmium::Location, osmium::Location> mm = std::minmax(first().location(), second().location(), [](const osmium::Location a, const osmium::Location b) {
|
||
|
|
return a.y() < b.y();
|
||
|
|
});
|
||
|
|
|
||
|
|
if (mm.first.y() >= location.y() || mm.second.y() < location.y() || first().location().x() > location.x()) {
|
||
|
|
// std::cerr << " false\n";
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
int64_t ax = mm.first.x();
|
||
|
|
int64_t bx = mm.second.x();
|
||
|
|
int64_t lx = location.x();
|
||
|
|
int64_t ay = mm.first.y();
|
||
|
|
int64_t by = mm.second.y();
|
||
|
|
int64_t ly = location.y();
|
||
|
|
return ((bx - ax)*(ly - ay) - (by - ay)*(lx - ax)) <= 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool role_outer() const noexcept {
|
||
|
|
return !strcmp(m_role, "outer");
|
||
|
|
}
|
||
|
|
|
||
|
|
bool role_inner() const noexcept {
|
||
|
|
return !strcmp(m_role, "inner");
|
||
|
|
}
|
||
|
|
|
||
|
|
const osmium::Way* way() const noexcept {
|
||
|
|
return m_way;
|
||
|
|
}
|
||
|
|
|
||
|
|
}; // class NodeRefSegment
|
||
|
|
|
||
|
|
/// NodeRefSegments are equal if both their locations are equal
|
||
|
|
inline bool operator==(const NodeRefSegment& lhs, const NodeRefSegment& rhs) noexcept {
|
||
|
|
return lhs.first().location() == rhs.first().location() && lhs.second().location() == rhs.second().location();
|
||
|
|
}
|
||
|
|
|
||
|
|
inline bool operator!=(const NodeRefSegment& lhs, const NodeRefSegment& rhs) noexcept {
|
||
|
|
return ! (lhs == rhs);
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* NodeRefSegments are "smaller" if they are to the left and down of another
|
||
|
|
* segment. The first() location is checked first() and only if they have the
|
||
|
|
* same first() location the second() location is taken into account.
|
||
|
|
*/
|
||
|
|
inline bool operator<(const NodeRefSegment& lhs, const NodeRefSegment& rhs) noexcept {
|
||
|
|
return (lhs.first().location() == rhs.first().location() && lhs.second().location() < rhs.second().location()) || lhs.first().location() < rhs.first().location();
|
||
|
|
}
|
||
|
|
|
||
|
|
inline bool operator>(const NodeRefSegment& lhs, const NodeRefSegment& rhs) noexcept {
|
||
|
|
return rhs < lhs;
|
||
|
|
}
|
||
|
|
|
||
|
|
inline bool operator<=(const NodeRefSegment& lhs, const NodeRefSegment& rhs) noexcept {
|
||
|
|
return ! (rhs < lhs);
|
||
|
|
}
|
||
|
|
|
||
|
|
inline bool operator>=(const NodeRefSegment& lhs, const NodeRefSegment& rhs) noexcept {
|
||
|
|
return ! (lhs < rhs);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename TChar, typename TTraits>
|
||
|
|
inline std::basic_ostream<TChar, TTraits>& operator<<(std::basic_ostream<TChar, TTraits>& out, const NodeRefSegment& segment) {
|
||
|
|
return out << segment.first() << "--" << segment.second();
|
||
|
|
}
|
||
|
|
|
||
|
|
inline bool outside_x_range(const NodeRefSegment& s1, const NodeRefSegment& s2) noexcept {
|
||
|
|
if (s1.first().location().x() > s2.second().location().x()) {
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
inline bool y_range_overlap(const NodeRefSegment& s1, const NodeRefSegment& s2) {
|
||
|
|
const std::pair<int32_t, int32_t> m1 = std::minmax(s1.first().location().y(), s1.second().location().y());
|
||
|
|
const std::pair<int32_t, int32_t> m2 = std::minmax(s2.first().location().y(), s2.second().location().y());
|
||
|
|
if (m1.first > m2.second || m2.first > m1.second) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Calculate the intersection between two NodeRefSegments. The
|
||
|
|
* result is returned as a Location. Note that because the Location
|
||
|
|
* uses integers with limited precision internally, the result
|
||
|
|
* might be slightly different than the numerically correct
|
||
|
|
* location.
|
||
|
|
*
|
||
|
|
* This function uses integer arithmentic as much as possible and
|
||
|
|
* will not work if the segments are longer than about half the
|
||
|
|
* planet. This shouldn't happen with real data, so it isn't a big
|
||
|
|
* problem.
|
||
|
|
*
|
||
|
|
* If the segments touch in one of their endpoints, it doesn't
|
||
|
|
* count as an intersection.
|
||
|
|
*
|
||
|
|
* If the segments intersect not in a single point but in multiple
|
||
|
|
* points, ie if they overlap, this is NOT detected.
|
||
|
|
*
|
||
|
|
* @returns Undefined osmium::Location if there is no intersection
|
||
|
|
* or a defined Location if the segments intersect.
|
||
|
|
*/
|
||
|
|
inline osmium::Location calculate_intersection(const NodeRefSegment& s1, const NodeRefSegment& s2) {
|
||
|
|
if (s1.first().location() == s2.first().location() ||
|
||
|
|
s1.first().location() == s2.second().location() ||
|
||
|
|
s1.second().location() == s2.first().location() ||
|
||
|
|
s1.second().location() == s2.second().location()) {
|
||
|
|
return osmium::Location();
|
||
|
|
}
|
||
|
|
|
||
|
|
int64_t s1ax = s1.first().x();
|
||
|
|
int64_t s1ay = s1.first().y();
|
||
|
|
int64_t s1bx = s1.second().x();
|
||
|
|
int64_t s1by = s1.second().y();
|
||
|
|
int64_t s2ax = s2.first().x();
|
||
|
|
int64_t s2ay = s2.first().y();
|
||
|
|
int64_t s2bx = s2.second().x();
|
||
|
|
int64_t s2by = s2.second().y();
|
||
|
|
|
||
|
|
int64_t d = (s2by - s2ay) * (s1bx - s1ax) -
|
||
|
|
(s2bx - s2ax) * (s1by - s1ay);
|
||
|
|
|
||
|
|
if (d != 0) {
|
||
|
|
int64_t na = (s2bx - s2ax) * (s1ay - s2ay) -
|
||
|
|
(s2by - s2ay) * (s1ax - s2ax);
|
||
|
|
|
||
|
|
int64_t nb = (s1bx - s1ax) * (s1ay - s2ay) -
|
||
|
|
(s1by - s1ay) * (s1ax - s2ax);
|
||
|
|
|
||
|
|
if ((d > 0 && na >= 0 && na <= d && nb >= 0 && nb <= d) ||
|
||
|
|
(d < 0 && na <= 0 && na >= d && nb <= 0 && nb >= d)) {
|
||
|
|
|
||
|
|
double ua = double(na) / d;
|
||
|
|
int32_t ix = int32_t(s1ax + ua*(s1bx - s1ax));
|
||
|
|
int32_t iy = int32_t(s1ay + ua*(s1by - s1ay));
|
||
|
|
|
||
|
|
return osmium::Location(ix, iy);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
return osmium::Location();
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace detail
|
||
|
|
|
||
|
|
} // namespace area
|
||
|
|
|
||
|
|
} // namespace osmium
|
||
|
|
|
||
|
|
#endif // OSMIUM_AREA_DETAIL_NODE_REF_SEGMENT_HPP
|