/usr/include/SFCGAL/algorithm/ConsistentOrientationBuilder.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 | /**
* 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_ALGORITHM_CONSISTENTORIENTATIONBUILDER_H_
#define _SFCGAL_ALGORITHM_CONSISTENTORIENTATIONBUILDER_H_
#include <SFCGAL/config.h>
#include <SFCGAL/Geometry.h>
#include <SFCGAL/detail/graph/GeometryGraph.h>
#include <SFCGAL/detail/graph/GeometryGraphBuilder.h>
namespace SFCGAL {
namespace algorithm {
/**
* Make orientation consistent in a triangle set
* @ingroup detail
*/
class SFCGAL_API ConsistentOrientationBuilder {
public:
typedef graph::GeometryGraph::vertex_descriptor vertex_descriptor ;
typedef graph::GeometryGraph::edge_descriptor edge_descriptor ;
typedef graph::GeometryGraph::directed_edge_descriptor directed_edge_descriptor ;
/**
* default constructor
*/
ConsistentOrientationBuilder() ;
/**
* add a Triangle
*/
void addTriangle( const Triangle& triangle ) ;
/**
* add a TriangulatedSurface
*/
void addTriangulatedSurface( const TriangulatedSurface& triangulatedSurface ) ;
/**
* get the resulting TriangulatedSurface where each connected part
* has consistent orientation.
*
* @throw SFCGAL::Exception if such a TriangulatedSurface can't be built
*/
TriangulatedSurface buildTriangulatedSurface() ;
/**
* returns the number of triangles
*/
inline size_t numTriangles() const {
return _triangles.size();
}
/**
* returns the n-th triangle
*/
Triangle triangleN( const size_t& n ) const ;
/**
* [advanced]use after buildTriangulatedSurface
*/
const std::set< size_t >& neighbors( const size_t& n ) const ;
private:
graph::GeometryGraph _graph ;
graph::GeometryGraphBuilder _graphBuilder ;
std::vector< std::vector< edge_descriptor > > _triangles ;
std::vector< bool > _visited ;
std::vector< bool > _oriented ;
std::vector< std::set< size_t > > _neighbors ;
/**
* make triangle orientation consistent
*/
void _makeOrientationConsistent() ;
/**
* compute neighbors for each triangles
*/
void _computeNeighbors() ;
/**
* find the next triangle to visit (may select a new reference triangle)
*/
int _findNextTriangle() ;
};
}//algorithm
}//SFCGAL
#endif
|