Developer Documentation
MeshNavigationT_impl.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 
45 
46 
47 //=============================================================================
48 //
49 // IMPLEMENTATION
50 //
51 //=============================================================================
52 
53 #define MESHNAVIGATIONT_C
54 
55 //== INCLUDES =================================================================
56 
57 #include "MeshNavigationT.hh"
58 
59 #include <OpenMesh/Core/Mesh/TriMesh_ArrayKernelT.hh>
60 #include <OpenMesh/Core/Geometry/MathDefs.hh>
61 
62 #include <queue>
63 //== NAMESPACES ===============================================================
64 
65 namespace MeshNavigation {
66 
67 //== IMPLEMENTATION ==========================================================
68 
69 template < typename MeshT >
70 inline
71 typename MeshT::HalfedgeHandle
72 opposite_halfedge(MeshT& _mesh , typename MeshT::HalfedgeHandle _he) {
73  typename MeshT::VertexOHalfedgeIter opp_he( _mesh , _he);
74  ++opp_he;
75  ++opp_he;
76  ++opp_he;
77  return (*opp_he);
78 }
79 
80 template < typename MeshT >
81 inline
82 typename MeshT::VertexHandle
83 findClosestBoundary(MeshT* _mesh , typename MeshT::VertexHandle _vh){
84 
85  //add visited property
87  _mesh->add_property(visited,"Visited Property" );
88 
89  //init visited property
90  typename MeshT::VertexIter v_it, v_end = _mesh->vertices_end();
91  for( v_it = _mesh->vertices_begin(); v_it != v_end; ++v_it )
92  _mesh->property( visited, *v_it ) = false;
93 
94  std::queue< typename MeshT::VertexHandle > queue;
95  queue.push( _vh );
96 
97  while(!queue.empty()){
98  typename MeshT::VertexHandle vh = queue.front();
99  queue.pop();
100  if (_mesh->property(visited, vh)) continue;
101 
102  for (typename MeshT::VertexOHalfedgeIter voh_it(*_mesh,vh); voh_it.is_valid(); ++voh_it){
103 
104  if ( _mesh->is_boundary(*voh_it) ){
105  _mesh->remove_property(visited);
106  return _mesh->to_vertex_handle(*voh_it);
107  }else{
108  queue.push( _mesh->to_vertex_handle(*voh_it) );
109  }
110  }
111  _mesh->property(visited, vh) = true;
112  }
113 
114  _mesh->remove_property(visited);
115  return typename MeshT::VertexHandle(-1);
116 }
117 
118 
119 //=============================================================================
120 } // MeshNavigation Namespace
121 //=============================================================================
MeshT::HalfedgeHandle opposite_halfedge(MeshT &_mesh, typename MeshT::HalfedgeHandle _he)
Functions for getting information about a mesh.
MeshT::VertexHandle findClosestBoundary(MeshT *_mesh, typename MeshT::VertexHandle _vh)
Find the closest boundary vertex to another vertex.