/usr/include/SFCGAL/detail/graph/GeometryGraphBuilder.h is in libsfcgal-dev 1.2.2-1.
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 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 | /**
* SFCGAL
*
* Copyright (C) 2012-2013 Oslandia <infos@oslandia.com>
* Copyright (C) 2012-2013 IGN (http://www.ign.fr)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
* You should have received a copy of the GNU Library General Public
* License along with this library; if not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _SFCGAL_GRAPH_GEOMETRYGRAPHBUILDER_H_
#define _SFCGAL_GRAPH_GEOMETRYGRAPHBUILDER_H_
#include <SFCGAL/Point.h>
#include <SFCGAL/LineString.h>
#include <SFCGAL/Polygon.h>
#include <SFCGAL/Triangle.h>
#include <SFCGAL/PolyhedralSurface.h>
#include <SFCGAL/TriangulatedSurface.h>
#include <SFCGAL/detail/graph/GeometryGraph.h>
namespace SFCGAL {
namespace graph {
/**
* @brief [private]Convert Geometries to a GeometryGraph. Identifier in the Graph are returned in order to
* allow the user to keep identify the geometry.
*
* @todo wrap vertex_descriptor, std::vector< edge_descriptor >, etc. in SharedPoint, SharedLineString, SharedPolygon, etc.
* and add utility method on the Graph?
*/
template < typename Graph >
class GeometryGraphBuilderT {
public:
typedef Graph graph_t ;
typedef typename graph_t::vertex_properties vertex_properties ;
typedef typename graph_t::edge_properties edge_properties ;
typedef typename graph_t::vertex_descriptor vertex_descriptor ;
typedef typename graph_t::edge_descriptor edge_descriptor ;
/**
* allows to match duplicates
*/
typedef std::map< Coordinate, vertex_descriptor > coordinate_list ;
/**
* default constructor
*/
GeometryGraphBuilderT( graph_t& graph ):
_graph( graph ) {
}
/**
* destructor
*/
~GeometryGraphBuilderT() {
}
/**
* add a Point to the Graph
*/
vertex_descriptor addPoint( const Point& point ) {
BOOST_ASSERT( ! point.isEmpty() );
typename coordinate_list::const_iterator it = _vertices.find( point.coordinate() ) ;
if ( it != _vertices.end() ) {
return it->second ;
}
else {
vertex_descriptor vertex = _graph.addVertex( vertex_properties( point.coordinate() ) );
_vertices.insert( std::make_pair( point.coordinate(), vertex ) );
return vertex ;
}
}
/**
* add a Point to the Graph
* @return the edge inserted into the graph
*/
edge_descriptor addLineSegment(
const Point& a,
const Point& b,
const edge_properties& edgeProperties = edge_properties()
) {
BOOST_ASSERT( ! a.isEmpty() );
BOOST_ASSERT( ! b.isEmpty() );
return _graph.addEdge(
addPoint( a ),
addPoint( b ),
edgeProperties
);
}
/**
* add a LineString to the graph
* @return the list of edges inserted into the graph
*/
std::vector< edge_descriptor > addLineString(
const LineString& lineString,
const edge_properties& edgeProperties = edge_properties()
) {
BOOST_ASSERT( ! lineString.isEmpty() );
std::vector< edge_descriptor > edges ;
for ( size_t i = 0; i < lineString.numPoints() - 1; i++ ) {
edges.push_back( addLineSegment( lineString.pointN( i ), lineString.pointN( i+1 ), edgeProperties ) );
}
return edges ;
}
/**
* add a Triangle to the graph
* @return the list of edges inserted into the graph
*/
std::vector< edge_descriptor > addTriangle(
const Triangle& triangle,
const edge_properties& edgeProperties = edge_properties()
) {
BOOST_ASSERT( ! triangle.isEmpty() );
std::vector< edge_descriptor > edges ;
for ( size_t i = 0; i < 3; i++ ) {
edges.push_back( addLineSegment(
triangle.vertex( i ),
triangle.vertex( i+1 ),
edgeProperties
) );
}
return edges ;
}
/**
* add a Polygon to the graph
* @returns the list of rings inserted into the graph
*/
std::vector< std::vector< edge_descriptor > > addPolygon(
const Polygon& polygon,
const edge_properties& edgeProperties = edge_properties()
) {
BOOST_ASSERT( ! polygon.isEmpty() );
std::vector< std::vector< edge_descriptor > > rings ;
for ( size_t i = 0; i < polygon.numRings(); i++ ) {
rings.push_back( addLineString( polygon.ringN( i ), edgeProperties ) );
}
return rings ;
}
/**
* add a TriangulatedSurface to the graph
* @returns the list of rings inserted into the graph
*/
std::vector< std::vector< edge_descriptor > > addTriangulatedSurface(
const TriangulatedSurface& triangulatedSurface,
const edge_properties& edgeProperties = edge_properties()
) {
BOOST_ASSERT( ! triangulatedSurface.isEmpty() );
std::vector< std::vector< edge_descriptor > > triangles ;
for ( size_t i = 0; i < triangulatedSurface.numGeometries(); i++ ) {
triangles.push_back( addTriangle( triangulatedSurface.geometryN( i ), edgeProperties ) );
}
return triangles ;
}
/**
* add a PolyhedralSurface to the graph
* @returns the list of rings inserted into the graph
*/
std::vector< std::vector< std::vector< edge_descriptor > > > addPolyhedralSurface(
const PolyhedralSurface& polyhedralSurface,
const edge_properties& edgeProperties = edge_properties()
) {
BOOST_ASSERT( ! polyhedralSurface.isEmpty() );
std::vector< std::vector< std::vector< edge_descriptor > > > polygons ;
for ( size_t i = 0; i < polyhedralSurface.numPolygons(); i++ ) {
polygons.push_back( addPolygon( polyhedralSurface.polygonN( i ), edgeProperties ) );
}
return polygons ;
}
private:
graph_t& _graph ;
coordinate_list _vertices ;
/**
* no copy constructor
*/
GeometryGraphBuilderT( const GeometryGraphBuilderT& other ) ;
};
typedef GeometryGraphBuilderT< GeometryGraph > GeometryGraphBuilder ;
}//topology
}//SFCGAL
#endif
|