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