/usr/include/geos/operation/relate/RelateNodeGraph.h is in libgeos-dev 3.2.2-3ubuntu1.
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 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 | /**********************************************************************
* $Id: RelateNodeGraph.h 2557 2009-06-08 09:30:55Z strk $
*
* GEOS - Geometry Engine Open Source
* http://geos.refractions.net
*
* Copyright (C) 2006 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.
*
**********************************************************************
*
* Last port: operation/relate/RelateNodeGraph.java rev. 1.11 (JTS-1.10)
*
**********************************************************************/
#ifndef GEOS_OP_RELATE_RELATENODEGRAPH_H
#define GEOS_OP_RELATE_RELATENODEGRAPH_H
#include <geos/export.h>
#include <map>
#include <vector>
// Forward declarations
namespace geos {
namespace geom {
class Coordinate;
struct CoordinateLessThen;
}
namespace geomgraph {
//class EdgeEndStar;
class Node;
class GeometryGraph;
class EdgeEnd;
class NodeMap;
}
}
namespace geos {
namespace operation { // geos::operation
namespace relate { // geos::operation::relate
/** \brief
* Implements the simple graph of Nodes and geomgraph::EdgeEnd which is all that is
* required to determine topological relationships between Geometries.
*
* Also supports building a topological graph of a single Geometry, to
* allow verification of valid topology.
*
* It is <b>not</b> necessary to create a fully linked
* PlanarGraph to determine relationships, since it is sufficient
* to know how the Geometries interact locally around the nodes.
* In fact, this is not even feasible, since it is not possible to compute
* exact intersection points, and hence the topology around those nodes
* cannot be computed robustly.
* The only Nodes that are created are for improper intersections;
* that is, nodes which occur at existing vertices of the Geometries.
* Proper intersections (e.g. ones which occur between the interior of
* line segments)
* have their topology determined implicitly, without creating a geomgraph::Node object
* to represent them.
*
*/
class GEOS_DLL RelateNodeGraph {
public:
RelateNodeGraph();
virtual ~RelateNodeGraph();
std::map<geom::Coordinate*, geomgraph::Node*,
geom::CoordinateLessThen> &getNodeMap();
void build(geomgraph::GeometryGraph *geomGraph);
void computeIntersectionNodes(geomgraph::GeometryGraph *geomGraph,
int argIndex);
void copyNodesAndLabels(geomgraph::GeometryGraph *geomGraph,int argIndex);
void insertEdgeEnds(std::vector<geomgraph::EdgeEnd*> *ee);
private:
geomgraph::NodeMap *nodes;
};
} // namespace geos:operation:relate
} // namespace geos:operation
} // namespace geos
#endif // GEOS_OP_RELATE_RELATENODEGRAPH_H
/**********************************************************************
* $Log$
* Revision 1.1 2006/03/21 13:11:29 strk
* opRelate.h header split
*
**********************************************************************/
|