/usr/include/CGAL/Umbilics.h is in libcgal-dev 4.7-4.
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 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 | // Copyright (c) 2007 INRIA Sophia-Antipolis (France), INRIA Lorraine LORIA.
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// 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 3 of the License, or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
//
// Author(s) : Marc Pouget and Frédéric Cazals
#ifndef CGAL_UMBILIC_H_
#define CGAL_UMBILIC_H_
#include <list>
#include <vector>
#include <math.h>
#include <CGAL/basic.h>
#include <CGAL/boost/graph/helpers.h>
#include <CGAL/PolyhedralSurf_neighbors.h>
#include <boost/shared_ptr.hpp>
namespace CGAL {
enum Umbilic_type { NON_GENERIC_UMBILIC = 0, ELLIPTIC_UMBILIC, HYPERBOLIC_UMBILIC};
//-------------------------------------------------------------------
//Umbilic : stores umbilic data, its location given by a vertex, its
//type and a circle of edges bording a disk containing the vertex
//------------------------------------------------------------------
template < class TriangleMesh >
class Umbilic
{
public:
typedef typename boost::graph_traits<TriangleMesh>::vertex_descriptor vertex_descriptor;
typedef typename boost::graph_traits<TriangleMesh>::halfedge_descriptor halfedge_descriptor;
//constructor
Umbilic(const TriangleMesh& P,
const vertex_descriptor v_init,
const std::list<halfedge_descriptor> contour_init);
//access fct
vertex_descriptor vertex() const { return v;}
Umbilic_type umbilic_type() const { return umb_type;}
Umbilic_type& umbilic_type() { return umb_type;}
const TriangleMesh& mesh()const { return P;}
const std::list<halfedge_descriptor>& contour_list() const { return contour;}
protected:
const TriangleMesh& P;
const vertex_descriptor v;
Umbilic_type umb_type;
const std::list<halfedge_descriptor> contour;
};
//constructor
template <class TriangleMesh>
Umbilic<TriangleMesh>::
Umbilic(const TriangleMesh& P,
const vertex_descriptor v_init,
const std::list<halfedge_descriptor> contour_init)
: P(P), v(v_init), contour(contour_init)
{}
template <class TriangleMesh>
std::ostream&
operator<<(std::ostream& out_stream, const Umbilic<TriangleMesh>& umbilic)
{
typedef typename boost::property_map<TriangleMesh,vertex_point_t>::const_type VPM;
VPM vpm = get(vertex_point, umbilic.mesh());
out_stream << "Umbilic at location (" << get(vpm, umbilic.vertex()) << ") of type ";
switch (umbilic.umbilic_type())
{
case CGAL::NON_GENERIC_UMBILIC: out_stream << "non generic" << std::endl; break;
case CGAL::ELLIPTIC_UMBILIC: out_stream << "elliptic" << std::endl; break;
case CGAL::HYPERBOLIC_UMBILIC: out_stream << "hyperbolic" << std::endl; break;
default : out_stream << "Something wrong occured for sure..." << std::endl; break;
}
return out_stream;
}
//---------------------------------------------------------------------------
//Umbilic_approximation : enable computation of umbilics of a
//TriangleMesh. It uses the class
//T_PolyhedralSurf_neighbors to compute topological disk patches
//around vertices
//--------------------------------------------------------------------------
template < class TriangleMesh, class VertexFTMap, class VertexVectorMap >
class Umbilic_approximation
{
typedef typename boost::property_map<TriangleMesh,vertex_point_t>::const_type VPM;
typedef typename boost::property_traits<VPM>::value_type Point_3;
typedef typename Kernel_traits<Point_3>::Kernel Kernel;
public:
typedef typename Kernel::FT FT;
typedef typename Kernel::Vector_3 Vector_3;
typedef typename boost::graph_traits<TriangleMesh>::vertex_descriptor vertex_descriptor;
typedef typename boost::graph_traits<TriangleMesh>::halfedge_descriptor halfedge_descriptor;
typedef typename boost::graph_traits<TriangleMesh>::face_iterator Facet_const_iterator;
typedef typename boost::graph_traits<TriangleMesh>::vertex_iterator Vertex_const_iterator;
//requirements for the templates TriangleMesh and VertexFTMap or VertexVectorMap
CGAL_static_assertion((boost::is_same<vertex_descriptor, typename VertexFTMap::key_type>::value));
CGAL_static_assertion((boost::is_same<vertex_descriptor, typename VertexVectorMap::key_type>::value));
CGAL_static_assertion((boost::is_same<FT, typename VertexFTMap::value_type>::value));
CGAL_static_assertion((boost::is_same<Vector_3, typename VertexVectorMap::value_type>::value));
typedef CGAL::Umbilic<TriangleMesh> Umbilic;
//constructor : sets propertymaps and the poly_neighbors
Umbilic_approximation(const TriangleMesh& P,
const VertexFTMap& vertex2k1_pm,
const VertexFTMap& vertex2k2_pm,
const VertexVectorMap& vertex2d1_pm,
const VertexVectorMap& vertex2d2_pm);
//identify umbilics as vertices minimizing the function k1-k2 on
//their patch and for which the index is not 0. We avoid
//potential umbilics whose contours touch the border.
template <class OutputIterator>
OutputIterator compute(OutputIterator it, FT size);
protected:
const TriangleMesh& P;
typedef T_PolyhedralSurf_neighbors<TriangleMesh> Poly_neighbors;
boost::shared_ptr<Poly_neighbors> poly_neighbors;
CGAL::Abs<FT> cgal_abs;
CGAL::To_double<FT> To_double;
//Property maps
const VertexFTMap &k1, &k2;
const VertexVectorMap &d1, &d2;
// index: following CW the contour, we choose an orientation for the
// max dir of an arbitrary starting point, the max dir field is
// oriented on the next point so that the scalar product of the
// consecutive vectors is positive. Adding all the angles between
// consecutive vectors around the contour gives ~ -/+180 for a
// wedge/trisector, ~ 0 gives a false umbilic, everything else gives
// a non_generic umbilic.
int compute_type(Umbilic& umb);
};
template < class TriangleMesh, class VertexFTMap, class VertexVectorMap >
Umbilic_approximation< TriangleMesh, VertexFTMap, VertexVectorMap >::
Umbilic_approximation(const TriangleMesh& p,
const VertexFTMap& vertex2k1_pm,
const VertexFTMap& vertex2k2_pm,
const VertexVectorMap& vertex2d1_pm,
const VertexVectorMap& vertex2d2_pm)
: P(p), k1(vertex2k1_pm), k2(vertex2k2_pm),
d1(vertex2d1_pm), d2(vertex2d2_pm)
{
CGAL_precondition(is_triangle_mesh(P));
poly_neighbors = boost::shared_ptr<Poly_neighbors>(new Poly_neighbors(P));
}
template < class TriangleMesh, class VertexFTMap, class VertexVectorMap >
template <class OutputIterator>
OutputIterator Umbilic_approximation< TriangleMesh, VertexFTMap, VertexVectorMap >::
compute(OutputIterator umbilics_it, FT size)
{
CGAL_precondition( size >= 1 );
std::vector<vertex_descriptor> vces;
std::list<halfedge_descriptor> contour;
FT umbilicEstimatorVertex, umbilicEstimatorNeigh;
bool is_umbilic = true;
//MAIN loop on P vertices
Vertex_const_iterator itb, ite;
boost::tie(itb,ite) = vertices(P);
for (;itb != ite; itb++) {
vertex_descriptor vh = *itb;
umbilicEstimatorVertex = cgal_abs(k1[vh]-k2[vh]);
//reset vector, list and bool
vces.clear();
contour.clear();
is_umbilic = true;
//the size of neighbourhood is (size * OneRingSize)
poly_neighbors->compute_neighbors(vh, vces, contour, size);
// avoid umbilics whose contours touch the border (Note may not be
// desirable?)
typename std::list<halfedge_descriptor>::const_iterator itb_cont = contour.begin(),
ite_cont = contour.end();
for (; itb_cont != ite_cont; itb_cont++)
if ( is_border(*itb_cont, P) ) {is_umbilic = false; continue;}
if (is_umbilic == false) continue;
//is v an umbilic?
//a priori is_umbilic = true, and it switches to false as soon as a
// neigh vertex has a lower umbilicEstimator value
typename std::vector<vertex_descriptor>::const_iterator itbv = vces.begin(),
itev = vces.end();
itbv++;
for (; itbv != itev; itbv++)
{ umbilicEstimatorNeigh = cgal_abs( k1[*itbv] - k2[*itbv] );
if ( umbilicEstimatorNeigh < umbilicEstimatorVertex )
{is_umbilic = false; break;}
}
if (is_umbilic == false) continue;
//v is an umbilic (wrt the min of k1-k2), compute the index. If
//the index is not 0 then we have actually an umbilic which is output
Umbilic* cur_umbilic = new Umbilic(P, vh, contour);
if (compute_type(*cur_umbilic) != 0) *umbilics_it++ = cur_umbilic;
}
return umbilics_it;
}
template < class TriangleMesh, class VertexFTMap, class VertexVectorMap >
int Umbilic_approximation< TriangleMesh, VertexFTMap, VertexVectorMap >::
compute_type(Umbilic& umb)
{
Vector_3 dir, dirnext, normal;
double cosinus, angle=0, angleSum=0;
const double pi=3.141592653589793;
vertex_descriptor v;
typename std::list<halfedge_descriptor>::const_iterator itb = umb.contour_list().begin(),
itlast = --umb.contour_list().end();
v = target(*itb, P);
dir = d1[v];
normal = CGAL::cross_product(d1[v], d2[v]);
//sum angles along the contour
do{
itb++;
v = target(*itb, P);
dirnext = d1[v];
cosinus = To_double(dir*dirnext);
if (cosinus < 0) {dirnext = dirnext*(-1); cosinus *= -1;}
if (cosinus>1) cosinus = 1;
//orientation of (dir, dirnext, normal)
if ( (dir * CGAL::cross_product(dirnext, normal)) > 0) angle = acos(cosinus);
else angle = -acos(cosinus);
angleSum += angle;
dir = dirnext;
normal = CGAL::cross_product(d1[v], d2[v]);
}
while (itb != (itlast));
//angle (v_last, v_0)
v = target(*umb.contour_list().begin(), P);
dirnext = d1[v];
cosinus = To_double(dir*dirnext);
if (cosinus < 0) {dirnext = dirnext*(-1); cosinus *= -1;}
if (cosinus>1) cosinus = 1;
if ( (dir * CGAL::cross_product(dirnext, normal)) > 0) angle = acos(cosinus);
else angle = -acos(cosinus);
angleSum += angle;
if ((angleSum > (pi/2)) && (angleSum < (3*pi/2))) umb.umbilic_type() = HYPERBOLIC_UMBILIC ;
else if ((angleSum < (-pi/2)) && (angleSum > (-3*pi/2))) umb.umbilic_type() = ELLIPTIC_UMBILIC;
else if ((angleSum <= (pi/2)) && (angleSum >= (-pi/2))) return 0;//is not considered as an umbilic
else umb.umbilic_type() = NON_GENERIC_UMBILIC;
return 1;
}
//Global function
template < class TriangleMesh,
class VertexFTMap,
class VertexVectorMap,
class OutputIterator>
OutputIterator compute_umbilics(const TriangleMesh &P,
const VertexFTMap& vertex2k1_pm,
const VertexFTMap& vertex2k2_pm,
const VertexVectorMap& vertex2d1_pm,
const VertexVectorMap& vertex2d2_pm,
OutputIterator it,
double size)
{
typedef Umbilic_approximation < TriangleMesh,
VertexFTMap, VertexVectorMap > Umbilic_approximation;
Umbilic_approximation umbilic_approximation(P,
vertex2k1_pm, vertex2k2_pm,
vertex2d1_pm, vertex2d2_pm);
return umbilic_approximation.compute(it, size);
}
} //namespace CGAL
#endif
|