Point Cloud Library (PCL)  1.7.0
get_boundary.h
1 /*
2  * Software License Agreement (BSD License)
3  *
4  * Point Cloud Library (PCL) - www.pointclouds.org
5  * Copyright (c) 2009-2012, Willow Garage, Inc.
6  * Copyright (c) 2012-, Open Perception, Inc.
7  *
8  * All rights reserved.
9  *
10  * Redistribution and use in source and binary forms, with or without
11  * modification, are permitted provided that the following conditions
12  * are met:
13  *
14  * * Redistributions of source code must retain the above copyright
15  * notice, this list of conditions and the following disclaimer.
16  * * Redistributions in binary form must reproduce the above
17  * copyright notice, this list of conditions and the following
18  * disclaimer in the documentation and/or other materials provided
19  * with the distribution.
20  * * Neither the name of the copyright holder(s) nor the names of its
21  * contributors may be used to endorse or promote products derived
22  * from this software without specific prior written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
25  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
26  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
27  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
28  * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
29  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
30  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
31  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
32  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
34  * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35  * POSSIBILITY OF SUCH DAMAGE.
36  *
37  * $Id$
38  *
39  */
40 
41 #ifndef PCL_GEOMETRY_GET_BOUNDARY_H
42 #define PCL_GEOMETRY_GET_BOUNDARY_H
43 
44 #include <vector>
45 
46 namespace pcl
47 {
48  namespace geometry
49  {
50  /** \brief Get a collection of boundary half-edges for the input mesh.
51  * \param[in] mesh The input mesh.
52  * \param[out] boundary_he_collection Collection of boundary half-edges. Each element in the vector is one connected boundary. The whole boundary is the union of all elements.
53  * \param [in] expected_size If you already know the size of the longest boundary you can tell this here. Defaults to 3 (minimum possible boundary).
54  * \author Martin Saelzle
55  * \ingroup geometry
56  */
57  template <class MeshT> void
58  getBoundBoundaryHalfEdges (const MeshT& mesh,
59  std::vector <typename MeshT::HalfEdgeIndices>& boundary_he_collection,
60  const size_t expected_size = 3)
61  {
62  typedef MeshT Mesh;
63  typedef typename Mesh::HalfEdgeIndex HalfEdgeIndex;
64  typedef typename Mesh::HalfEdgeIndices HalfEdgeIndices;
65  typedef typename Mesh::InnerHalfEdgeAroundFaceCirculator IHEAFC;
66 
67  boundary_he_collection.clear ();
68 
69  HalfEdgeIndices boundary_he; boundary_he.reserve (expected_size);
70  std::vector <bool> visited (mesh.sizeEdges (), false);
71  IHEAFC circ, circ_end;
72 
73  for (HalfEdgeIndex i (0); i<HalfEdgeIndex (mesh.sizeHalfEdges ()); ++i)
74  {
75  if (mesh.isBoundary (i) && !visited [pcl::geometry::toEdgeIndex (i).get ()])
76  {
77  boundary_he.clear ();
78 
79  circ = mesh.getInnerHalfEdgeAroundFaceCirculator (i);
80  circ_end = circ;
81  do
82  {
83  visited [pcl::geometry::toEdgeIndex (circ.getTargetIndex ()).get ()] = true;
84  boundary_he.push_back (circ.getTargetIndex ());
85  } while (++circ != circ_end);
86 
87  boundary_he_collection.push_back (boundary_he);
88  }
89  }
90  }
91 
92  } // End namespace geometry
93 } // End namespace pcl
94 
95 #endif // PCL_GEOMETRY_GET_BOUNDARY_H