You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
712 lines
23 KiB
712 lines
23 KiB
3 months ago
|
// Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
|
||
|
|
//
|
||
|
|
// This program is free software; you can redistribute it and/or modify
|
||
|
|
// it under the terms of the GNU General Public License, version 2.0,
|
||
|
|
// as published by the Free Software Foundation.
|
||
|
|
//
|
||
|
|
// This program is also distributed with certain software (including
|
||
|
|
// but not limited to OpenSSL) that is licensed under separate terms,
|
||
|
|
// as designated in a particular file or component or in included license
|
||
|
|
// documentation. The authors of MySQL hereby grant you an additional
|
||
|
|
// permission to link the program and your derivative works with the
|
||
|
|
// separately licensed software that they have included with MySQL.
|
||
|
|
//
|
||
|
|
// This program is distributed in the hope that it will be useful,
|
||
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
// GNU General Public License, version 2.0, for more details.
|
||
|
|
//
|
||
|
|
// You should have received a copy of the GNU General Public License
|
||
|
|
// along with this program; if not, write to the Free Software
|
||
|
|
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||
|
|
|
||
|
|
/// @file
|
||
|
|
///
|
||
|
|
/// This file implements the disjoint functor and function.
|
||
|
|
|
||
|
|
#include <boost/geometry.hpp>
|
||
|
|
|
||
|
|
#include "sql/dd/types/spatial_reference_system.h" // dd::Spatial_reference_system
|
||
|
|
#include "sql/gis/box.h"
|
||
|
|
#include "sql/gis/box_traits.h"
|
||
|
|
#include "sql/gis/disjoint_functor.h"
|
||
|
|
#include "sql/gis/geometries.h"
|
||
|
|
#include "sql/gis/geometries_traits.h"
|
||
|
|
#include "sql/gis/mbr_utils.h"
|
||
|
|
#include "sql/gis/relops.h"
|
||
|
|
#include "sql/sql_exception_handler.h" // handle_gis_exception
|
||
|
|
|
||
|
|
namespace bg = boost::geometry;
|
||
|
|
|
||
|
|
namespace gis {
|
||
|
|
|
||
|
|
/// Apply a Disjoint functor to two geometries, which both may be geometry
|
||
|
|
/// collections, and return the boolean result of the functor applied on each
|
||
|
|
/// combination of elements in the collections.
|
||
|
|
///
|
||
|
|
/// @tparam GC Coordinate specific gometry collection type.
|
||
|
|
///
|
||
|
|
/// @param f Functor to apply.
|
||
|
|
/// @param g1 First geometry.
|
||
|
|
/// @param g2 Second geometry.
|
||
|
|
///
|
||
|
|
/// @retval true g1 is disjoint from g2.
|
||
|
|
/// @retval false g1 isn't disjoint from g2.
|
||
|
|
template <typename GC>
|
||
|
|
static bool geometry_collection_apply_disjoint(const Disjoint &f,
|
||
|
|
const Geometry *g1,
|
||
|
|
const Geometry *g2) {
|
||
|
|
if (g1->type() == Geometry_type::kGeometrycollection) {
|
||
|
|
const auto gc1 = down_cast<const GC *>(g1);
|
||
|
|
for (const auto g1_i : *gc1) {
|
||
|
|
if (!geometry_collection_apply_disjoint<GC>(f, g1_i, g2)) return false;
|
||
|
|
}
|
||
|
|
} else if (g2->type() == Geometry_type::kGeometrycollection) {
|
||
|
|
const auto gc2 = down_cast<const GC *>(g2);
|
||
|
|
for (const auto g2_j : *gc2) {
|
||
|
|
if (!geometry_collection_apply_disjoint<GC>(f, g1, g2_j)) return false;
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
return f(g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
Disjoint::Disjoint(double semi_major, double semi_minor)
|
||
|
|
: m_geographic_pl_pa_strategy(
|
||
|
|
bg::srs::spheroid<double>(semi_major, semi_minor)),
|
||
|
|
m_geographic_ll_la_aa_strategy(
|
||
|
|
bg::srs::spheroid<double>(semi_major, semi_minor)) {}
|
||
|
|
|
||
|
|
bool Disjoint::operator()(const Geometry *g1, const Geometry *g2) const {
|
||
|
|
return apply(*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::operator()(const Box *b1, const Box *b2) const {
|
||
|
|
DBUG_ASSERT(b1->coordinate_system() == b2->coordinate_system());
|
||
|
|
switch (b1->coordinate_system()) {
|
||
|
|
case Coordinate_system::kCartesian:
|
||
|
|
return eval(down_cast<const Cartesian_box *>(b1),
|
||
|
|
down_cast<const Cartesian_box *>(b2));
|
||
|
|
case Coordinate_system::kGeographic:
|
||
|
|
return eval(down_cast<const Geographic_box *>(b1),
|
||
|
|
down_cast<const Geographic_box *>(b2));
|
||
|
|
}
|
||
|
|
|
||
|
|
DBUG_ASSERT(false);
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geometry *g1, const Geometry *g2) const {
|
||
|
|
// All parameter type combinations have been implemented.
|
||
|
|
DBUG_ASSERT(false);
|
||
|
|
throw not_implemented_exception::for_non_projected(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Cartesian_point, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_point *g1,
|
||
|
|
const Cartesian_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_point *g1,
|
||
|
|
const Cartesian_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_point *g1,
|
||
|
|
const Cartesian_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_point *g1,
|
||
|
|
const Cartesian_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Cartesian_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_point *g1,
|
||
|
|
const Cartesian_multipoint *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_point *g1,
|
||
|
|
const Cartesian_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_point *g1,
|
||
|
|
const Cartesian_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Cartesian_linestring, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_linestring *g1,
|
||
|
|
const Cartesian_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_linestring *g1,
|
||
|
|
const Cartesian_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_linestring *g1,
|
||
|
|
const Cartesian_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_linestring *g1,
|
||
|
|
const Cartesian_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Cartesian_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_linestring *g1,
|
||
|
|
const Cartesian_multipoint *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_linestring *g1,
|
||
|
|
const Cartesian_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_linestring *g1,
|
||
|
|
const Cartesian_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Cartesian_polygon, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_polygon *g1,
|
||
|
|
const Cartesian_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_polygon *g1,
|
||
|
|
const Cartesian_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_polygon *g1,
|
||
|
|
const Cartesian_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_polygon *g1,
|
||
|
|
const Cartesian_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Cartesian_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_polygon *g1,
|
||
|
|
const Cartesian_multipoint *g2) const {
|
||
|
|
return eval(g2, g1);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_polygon *g1,
|
||
|
|
const Cartesian_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_polygon *g1,
|
||
|
|
const Cartesian_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Cartesian_geometrycollection, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_geometrycollection *g1,
|
||
|
|
const Geometry *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Cartesian_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Cartesian_multipoint, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipoint *g1,
|
||
|
|
const Cartesian_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipoint *g1,
|
||
|
|
const Cartesian_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipoint *g1,
|
||
|
|
const Cartesian_polygon *g2) const {
|
||
|
|
// All points in g1 must be disjoint from g2.
|
||
|
|
for (auto &pt : *g1) {
|
||
|
|
if (!bg::disjoint(pt, *g2)) return false;
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipoint *g1,
|
||
|
|
const Cartesian_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Cartesian_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipoint *g1,
|
||
|
|
const Cartesian_multipoint *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipoint *g1,
|
||
|
|
const Cartesian_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipoint *g1,
|
||
|
|
const Cartesian_multipolygon *g2) const {
|
||
|
|
// All points in g1 must be disjoint from g2.
|
||
|
|
for (auto &pt : *g1) {
|
||
|
|
if (!bg::disjoint(pt, *g2)) return false;
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Cartesian_multilinestring, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multilinestring *g1,
|
||
|
|
const Cartesian_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multilinestring *g1,
|
||
|
|
const Cartesian_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multilinestring *g1,
|
||
|
|
const Cartesian_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multilinestring *g1,
|
||
|
|
const Cartesian_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Cartesian_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multilinestring *g1,
|
||
|
|
const Cartesian_multipoint *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multilinestring *g1,
|
||
|
|
const Cartesian_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multilinestring *g1,
|
||
|
|
const Cartesian_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Cartesian_multipolygon, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipolygon *g1,
|
||
|
|
const Cartesian_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipolygon *g1,
|
||
|
|
const Cartesian_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipolygon *g1,
|
||
|
|
const Cartesian_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipolygon *g1,
|
||
|
|
const Cartesian_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Cartesian_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipolygon *g1,
|
||
|
|
const Cartesian_multipoint *g2) const {
|
||
|
|
return eval(g2, g1);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipolygon *g1,
|
||
|
|
const Cartesian_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_multipolygon *g1,
|
||
|
|
const Cartesian_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Geographic_point, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_point *g1,
|
||
|
|
const Geographic_point *g2) const {
|
||
|
|
// Default strategy is OK. P/P computations do not depend on shape of
|
||
|
|
// ellipsoid.
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_point *g1,
|
||
|
|
const Geographic_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_point *g1,
|
||
|
|
const Geographic_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_point *g1,
|
||
|
|
const Geographic_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Geographic_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_point *g1,
|
||
|
|
const Geographic_multipoint *g2) const {
|
||
|
|
// Default strategy is OK. P/P computations do not depend on shape of
|
||
|
|
// ellipsoid.
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_point *g1,
|
||
|
|
const Geographic_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_point *g1,
|
||
|
|
const Geographic_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Geographic_linestring, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_linestring *g1,
|
||
|
|
const Geographic_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_linestring *g1,
|
||
|
|
const Geographic_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_linestring *g1,
|
||
|
|
const Geographic_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_linestring *g1,
|
||
|
|
const Geographic_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Geographic_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_linestring *g1,
|
||
|
|
const Geographic_multipoint *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_linestring *g1,
|
||
|
|
const Geographic_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_linestring *g1,
|
||
|
|
const Geographic_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Geographic_polygon, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_polygon *g1,
|
||
|
|
const Geographic_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_polygon *g1,
|
||
|
|
const Geographic_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_polygon *g1,
|
||
|
|
const Geographic_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_polygon *g1,
|
||
|
|
const Geographic_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Geographic_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_polygon *g1,
|
||
|
|
const Geographic_multipoint *g2) const {
|
||
|
|
return eval(g2, g1);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_polygon *g1,
|
||
|
|
const Geographic_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_polygon *g1,
|
||
|
|
const Geographic_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Geographic_geometrycollection, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_geometrycollection *g1,
|
||
|
|
const Geometry *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Geographic_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Geographic_multipoint, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipoint *g1,
|
||
|
|
const Geographic_point *g2) const {
|
||
|
|
// Default strategy is OK. P/P computations do not depend on shape of
|
||
|
|
// ellipsoid.
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipoint *g1,
|
||
|
|
const Geographic_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipoint *g1,
|
||
|
|
const Geographic_polygon *g2) const {
|
||
|
|
// All points in g1 must be disjoint from g2.
|
||
|
|
for (auto &pt : *g1) {
|
||
|
|
if (!bg::disjoint(pt, *g2, m_geographic_pl_pa_strategy)) return false;
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipoint *g1,
|
||
|
|
const Geographic_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Geographic_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipoint *g1,
|
||
|
|
const Geographic_multipoint *g2) const {
|
||
|
|
// Default strategy is OK. P/P computations do not depend on shape of
|
||
|
|
// ellipsoid.
|
||
|
|
return bg::disjoint(*g1, *g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipoint *g1,
|
||
|
|
const Geographic_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipoint *g1,
|
||
|
|
const Geographic_multipolygon *g2) const {
|
||
|
|
// All points in g1 must be disjoint from g2.
|
||
|
|
for (auto &pt : *g1) {
|
||
|
|
if (!bg::disjoint(pt, *g2, m_geographic_pl_pa_strategy)) return false;
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Geographic_multilinestring, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multilinestring *g1,
|
||
|
|
const Geographic_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multilinestring *g1,
|
||
|
|
const Geographic_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multilinestring *g1,
|
||
|
|
const Geographic_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multilinestring *g1,
|
||
|
|
const Geographic_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Geographic_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multilinestring *g1,
|
||
|
|
const Geographic_multipoint *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multilinestring *g1,
|
||
|
|
const Geographic_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multilinestring *g1,
|
||
|
|
const Geographic_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Geographic_multipolygon, *)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipolygon *g1,
|
||
|
|
const Geographic_point *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_pl_pa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipolygon *g1,
|
||
|
|
const Geographic_linestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipolygon *g1,
|
||
|
|
const Geographic_polygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipolygon *g1,
|
||
|
|
const Geographic_geometrycollection *g2) const {
|
||
|
|
return geometry_collection_apply_disjoint<Geographic_geometrycollection>(
|
||
|
|
*this, g1, g2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipolygon *g1,
|
||
|
|
const Geographic_multipoint *g2) const {
|
||
|
|
return eval(g2, g1);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipolygon *g1,
|
||
|
|
const Geographic_multilinestring *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_multipolygon *g1,
|
||
|
|
const Geographic_multipolygon *g2) const {
|
||
|
|
return bg::disjoint(*g1, *g2, m_geographic_ll_la_aa_strategy);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// disjoint(Box, Box)
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Cartesian_box *b1, const Cartesian_box *b2) const {
|
||
|
|
return bg::disjoint(*b1, *b2);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool Disjoint::eval(const Geographic_box *b1, const Geographic_box *b2) const {
|
||
|
|
return bg::disjoint(*b1, *b2);
|
||
|
|
}
|
||
|
|
|
||
|
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
bool disjoint(const dd::Spatial_reference_system *srs, const Geometry *g1,
|
||
|
|
const Geometry *g2, const char *func_name, bool *disjoint,
|
||
|
|
bool *null) noexcept {
|
||
|
|
try {
|
||
|
|
DBUG_ASSERT(g1->coordinate_system() == g2->coordinate_system());
|
||
|
|
DBUG_ASSERT(srs == nullptr ||
|
||
|
|
((srs->is_cartesian() &&
|
||
|
|
g1->coordinate_system() == Coordinate_system::kCartesian) ||
|
||
|
|
(srs->is_geographic() &&
|
||
|
|
g1->coordinate_system() == Coordinate_system::kGeographic)));
|
||
|
|
|
||
|
|
if ((*null = (g1->is_empty() || g2->is_empty()))) return false;
|
||
|
|
|
||
|
|
Disjoint disjoint_func(srs ? srs->semi_major_axis() : 0.0,
|
||
|
|
srs ? srs->semi_minor_axis() : 0.0);
|
||
|
|
*disjoint = disjoint_func(g1, g2);
|
||
|
|
} catch (...) {
|
||
|
|
handle_gis_exception(func_name);
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool mbr_disjoint(const dd::Spatial_reference_system *srs, const Geometry *g1,
|
||
|
|
const Geometry *g2, const char *func_name, bool *disjoint,
|
||
|
|
bool *null) noexcept {
|
||
|
|
try {
|
||
|
|
DBUG_ASSERT(g1->coordinate_system() == g2->coordinate_system());
|
||
|
|
DBUG_ASSERT(srs == nullptr ||
|
||
|
|
((srs->is_cartesian() &&
|
||
|
|
g1->coordinate_system() == Coordinate_system::kCartesian) ||
|
||
|
|
(srs->is_geographic() &&
|
||
|
|
g1->coordinate_system() == Coordinate_system::kGeographic)));
|
||
|
|
|
||
|
|
if ((*null = (g1->is_empty() || g2->is_empty()))) return false;
|
||
|
|
|
||
|
|
Disjoint disjoint_func(srs ? srs->semi_major_axis() : 0.0,
|
||
|
|
srs ? srs->semi_minor_axis() : 0.0);
|
||
|
|
|
||
|
|
switch (g1->coordinate_system()) {
|
||
|
|
case Coordinate_system::kCartesian: {
|
||
|
|
Cartesian_box mbr1;
|
||
|
|
box_envelope(g1, srs, &mbr1);
|
||
|
|
Cartesian_box mbr2;
|
||
|
|
box_envelope(g2, srs, &mbr2);
|
||
|
|
*disjoint = disjoint_func(&mbr1, &mbr2);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
case Coordinate_system::kGeographic: {
|
||
|
|
Geographic_box mbr1;
|
||
|
|
box_envelope(g1, srs, &mbr1);
|
||
|
|
Geographic_box mbr2;
|
||
|
|
box_envelope(g2, srs, &mbr2);
|
||
|
|
*disjoint = disjoint_func(&mbr1, &mbr2);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} catch (...) {
|
||
|
|
handle_gis_exception(func_name);
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace gis
|