/usr/include/geos/opRelate.h is in libgeos++-dev 3.6.2-1build2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 | /**********************************************************************
*
* GEOS - Geometry Engine Open Source
* http://geos.osgeo.org
*
* Copyright (C) 2001-2002 Vivid Solutions Inc.
* Copyright (C) 2005 Refractions Research Inc.
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU Lesser General Public Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************/
#ifndef GEOS_OPRELATE_H
#define GEOS_OPRELATE_H
namespace geos {
namespace operation { // geos::operation
/** \brief
* Contains classes to implement the computation of the spatial relationships of <CODE>Geometry</CODE>s.
*
* The <code>relate</code> algorithm computes the <code>IntersectionMatrix</code> describing the
* relationship of two <code>Geometry</code>s. The algorithm for computing <code>relate</code>
* uses the intersection operations supported by topology graphs. Although the <code>relate</code>
* result depends on the resultant graph formed by the computed intersections, there is
* no need to explicitly compute the entire graph.
* It is sufficient to compute the local structure of the graph
* at each intersection node.
* <P>
* The algorithm to compute <code>relate</code> has the following steps:
* <UL>
* <LI>Build topology graphs of the two input geometries. For each geometry
* all self-intersection nodes are computed and added to the graph.
* <LI>Compute nodes for all intersections between edges and nodes of the graphs.
* <LI>Compute the labeling for the computed nodes by merging the labels from the input graphs.
* <LI>Compute the labeling for isolated components of the graph (see below)
* <LI>Compute the <code>IntersectionMatrix</code> from the labels on the nodes and edges.
* </UL>
*
* <H3>Labeling isolated components</H3>
*
* Isolated components are components (edges or nodes) of an input <code>Geometry</code> which
* do not contain any intersections with the other input <code>Geometry</code>. The
* topological relationship of these components to the other input <code>Geometry</code>
* must be computed in order to determine the complete labeling of the component. This can
* be done by testing whether the component lies in the interior or exterior of the other
* <code>Geometry</code>. If the other <code>Geometry</code> is 1-dimensional, the isolated
* component must lie in the exterior (since otherwise it would have an intersection with an
* edge of the <code>Geometry</code>). If the other <code>Geometry</code> is 2-dimensional,
* a Point-In-Polygon test can be used to determine whether the isolated component is in the
* interior or exterior.
*
* <h2>Package Specification</h2>
*
* <ul>
* <li>Java Topology Suite Technical Specifications
* <li><A HREF="http://www.opengis.org/techno/specs.htm">
* OpenGIS Simple Features Specification for SQL</A>
* </ul>
*
*/
namespace relate { // geos.operation.relate
} // namespace geos:operation:relate
} // namespace geos:operation
} // namespace geos
//#include <geos/operation/relate/EdgeEndBuilder.h>
//#include <geos/operation/relate/EdgeEndBundle.h>
//#include <geos/operation/relate/EdgeEndBundleStar.h>
#include <geos/operation/relate/RelateComputer.h>
//#include <geos/operation/relate/RelateNode.h>
//#include <geos/operation/relate/RelateNodeFactory.h>
//#include <geos/operation/relate/RelateNodeGraph.h>
#include <geos/operation/relate/RelateOp.h>
#endif
|