/usr/include/gamera/geostructs/delaunaytree.hpp is in python-gamera-dev 1:3.4.2+git20160808.1725654-2.
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 | #ifndef DELAUNAYTREE_20100430_HPP
#define DELAUNAYTREE_20100430_HPP
//
// Copyright (C) 2010-2012 Oliver Christen, Christoph Dalitz
//
// This code is based on the Delaunay_Tree implementation
// http://people.sc.fsu.edu/~burkardt/cpp_src/delaunay_tree_2d/
// with the kind permission by Olivier Devillers.
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// 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 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 Street, Fifth Floor, Boston, MA 02110-1301 USA.
//
#include <vector>
#include <map>
#include <set>
#include <stdexcept>
#include <list>
//-------------------------------------------------------------------------
// data structure for computing the two dimensional Delaunay triangulation
//-------------------------------------------------------------------------
namespace Gamera { namespace Delaunaytree {
class Vertex;
class TriangleFlag;
class TriangleList;
class DelaunayTree;
class Triangle;
// Vertex
class Vertex {
private:
double x;
double y;
int label;
public:
Vertex(double x, double y);
Vertex(double x, double y, int label);
double getX();
double getY();
int getLabel();
friend Vertex operator+(Vertex a, Vertex b);
friend Vertex operator-(Vertex a, Vertex b);
friend double operator*(Vertex a, Vertex b);
friend double operator^(Vertex a, Vertex b);
};
// TriangleFlag
class TriangleFlag {
private:
int flag;
public:
TriangleFlag();
void kill();
bool isDead();
void setInfinite(int i);
int isInfinite();
void setLastFinite();
bool isLastFinite();
int getFlag();
};
// TriangleList
class TriangleList {
private:
Triangle *triangle;
TriangleList *next;
public:
TriangleList(TriangleList *list, Triangle *triangle);
~TriangleList();
Triangle * getTriangle();
TriangleList * getNext();
};
// DelaunayTree
class DelaunayTree {
private:
int number;
Triangle *root;
std::vector<Triangle*> triangles;
public:
DelaunayTree();
~DelaunayTree();
void addVertex(Vertex *v);
void addVertices(std::vector<Vertex*> *vertices);
void appendTriangle(Triangle *t);
void neighboringLabels(std::map<int,std::set<int> > *lbmap);
void neighboringVertices(std::map<Vertex*,std::set<Vertex*> > *vmap);
void getTriangles(std::list< std::vector<Vertex*>* > *triangles);
};
// Triangle
class Triangle {
private:
int number;
TriangleFlag flag;
Vertex *vertices[3];
Triangle *neighbors[3];
TriangleList *sons;
public:
Triangle(DelaunayTree *tree);
Triangle(DelaunayTree *tree, Triangle *parent, int i);
Triangle(DelaunayTree *tree, Triangle *parent, Vertex *v, int i);
~Triangle();
bool Conflict(Vertex *v);
Triangle * findConflict(Vertex *v);
TriangleFlag * getFlag();
Vertex * getVertex(int i);
void setNeighbor(int i, Triangle *t);
Triangle * getNeighbor(int i);
void setNumber(int i);
int getNumber();
int NeighborIndex(Triangle *t);
int cwNeighbor(Vertex *v);
void neighboringVertices(std::map<Vertex*,std::set<Vertex*> > *allneighbors);
void neighboringLabels(std::map<int,std::set<int> > *allneighbors);
void getTriangles(std::list< std::vector<Vertex*>* > *triangles);
};
}} // end namespace Gamera::Delaunaytree
#endif
|