Developer Documentation
IsotropicRemesherT.hh
1/*===========================================================================*\
2* *
3* OpenFlipper *
4 * Copyright (c) 2001-2015, RWTH-Aachen University *
5 * Department of Computer Graphics and Multimedia *
6 * All rights reserved. *
7 * www.openflipper.org *
8 * *
9 *---------------------------------------------------------------------------*
10 * This file is part of OpenFlipper. *
11 *---------------------------------------------------------------------------*
12 * *
13 * Redistribution and use in source and binary forms, with or without *
14 * modification, are permitted provided that the following conditions *
15 * are met: *
16 * *
17 * 1. Redistributions of source code must retain the above copyright notice, *
18 * this list of conditions and the following disclaimer. *
19 * *
20 * 2. Redistributions in binary form must reproduce the above copyright *
21 * notice, this list of conditions and the following disclaimer in the *
22 * documentation and/or other materials provided with the distribution. *
23 * *
24 * 3. Neither the name of the copyright holder nor the names of its *
25 * contributors may be used to endorse or promote products derived from *
26 * this software without specific prior written permission. *
27 * *
28 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS *
29 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *
30 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A *
31 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *
32 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, *
33 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, *
34 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR *
35 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF *
36 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING *
37 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS *
38 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
39* *
40\*===========================================================================*/
41
42
43
44#ifndef ISOTROPICREMESHER_HH
45#define ISOTROPICREMESHER_HH
46#include "IsoRemesherProgressEmitter.hh"
47
48
49template< class MeshT >
51
52public:
53
54 explicit IsotropicRemesher(IsoRemesherProgressEmitter* _prgEmt = NULL) : prgEmt_(_prgEmt) {};
56
57 void remesh( MeshT& _mesh, const double _targetEdgeLength );
58
59private:
60
61 void splitLongEdges( MeshT& _mesh, const double _maxEdgeLength );
62
63 void collapseShortEdges( MeshT& _mesh, const double _minEdgeLength, const double _maxEdgeLength );
64
65 void equalizeValences( MeshT& _mesh );
66
67 inline
68 int targetValence( MeshT& _mesh, const typename MeshT::VertexHandle& _vh );
69
70 void tangentialRelaxation( MeshT& _mesh );
71
72 template <class SpatialSearchT>
73 typename MeshT::Point
74 findNearestPoint(const MeshT& _mesh,
75 const typename MeshT::Point& _point,
76 typename MeshT::FaceHandle& _fh,
77 SpatialSearchT* _ssearch,
78 double* _dbest);
79
80 OpenMeshTriangleBSPT< MeshT >* getTriangleBSP(MeshT& _mesh);
81
82 template< class SpatialSearchT >
83 void projectToSurface( MeshT& _mesh, MeshT& _original, SpatialSearchT* _ssearch );
84
85 inline
86 bool isBoundary( MeshT& _mesh, const typename MeshT::VertexHandle& _vh);
87
88 inline
89 bool isFeature( MeshT& _mesh, const typename MeshT::VertexHandle& _vh);
90
91 private:
93};
94
95//=============================================================================
96#if defined(INCLUDE_TEMPLATES) && !defined(ISOTROPICREMESHER_C)
97#define ISOTROPICREMESHER_TEMPLATES
98#include "IsotropicRemesherT_impl.hh"
99#endif
100//=============================================================================
101#endif // ISOTROPICREMESHER_HH defined
102//=============================================================================
void collapseShortEdges(MeshT &_mesh, const double _minEdgeLength, const double _maxEdgeLength)
collapse edges shorter than minEdgeLength if collapsing doesn't result in new edge longer than maxEdg...
void remesh(MeshT &_mesh, const double _targetEdgeLength)
do the remeshing
void splitLongEdges(MeshT &_mesh, const double _maxEdgeLength)
performs edge splits until all edges are shorter than the threshold
int targetValence(MeshT &_mesh, const typename MeshT::VertexHandle &_vh)
returns 4 for boundary vertices and 6 otherwise