Point Cloud Library (PCL)  1.6.0
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
shapes.hpp
Go to the documentation of this file.
1 /*
2  * Software License Agreement (BSD License)
3  *
4  * Copyright (c) 2010, Willow Garage, Inc.
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  *
11  * * Redistributions of source code must retain the above copyright
12  * notice, this list of conditions and the following disclaimer.
13  * * Redistributions in binary form must reproduce the above
14  * copyright notice, this list of conditions and the following
15  * disclaimer in the documentation and/or other materials provided
16  * with the distribution.
17  * * Neither the name of Willow Garage, Inc. nor the names of its
18  * contributors may be used to endorse or promote products derived
19  * from this software without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25  * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
27  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
29  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
31  * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
32  * POSSIBILITY OF SUCH DAMAGE.
33  *
34  * $Id: shapes.hpp 5498 2012-04-04 06:51:24Z rusu $
35  *
36  */
37 
39 template <typename PointT> vtkSmartPointer<vtkDataSet>
41 {
42  vtkSmartPointer<vtkUnstructuredGrid> poly_grid;
43  if (cloud->points.empty ())
44  return (poly_grid);
45 
46  vtkSmartPointer<vtkPoints> poly_points = vtkSmartPointer<vtkPoints>::New ();
47  vtkSmartPointer<vtkPolygon> polygon = vtkSmartPointer<vtkPolygon>::New ();
48 
49  poly_points->SetNumberOfPoints (cloud->points.size ());
50  polygon->GetPointIds ()->SetNumberOfIds (cloud->points.size ());
51 
52  size_t i;
53  for (i = 0; i < cloud->points.size (); ++i)
54  {
55  poly_points->SetPoint (i, cloud->points[i].x, cloud->points[i].y, cloud->points[i].z);
56  polygon->GetPointIds ()->SetId (i, i);
57  }
58 
59  allocVtkUnstructuredGrid (poly_grid);
60  poly_grid->Allocate (1, 1);
61  poly_grid->InsertNextCell (polygon->GetCellType (), polygon->GetPointIds ());
62  poly_grid->SetPoints (poly_points);
63  poly_grid->Update ();
64 
65  return (poly_grid);
66 }
67 
69 template <typename PointT> vtkSmartPointer<vtkDataSet>
71 {
72  vtkSmartPointer<vtkUnstructuredGrid> poly_grid;
73  if (planar_polygon.getContour ().empty ())
74  return (poly_grid);
75 
76  vtkSmartPointer<vtkPoints> poly_points = vtkSmartPointer<vtkPoints>::New ();
77  vtkSmartPointer<vtkPolygon> polygon = vtkSmartPointer<vtkPolygon>::New ();
78 
79  poly_points->SetNumberOfPoints (planar_polygon.getContour ().size () + 1);
80  polygon->GetPointIds ()->SetNumberOfIds (planar_polygon.getContour ().size () + 1);
81 
82  size_t i;
83  for (i = 0; i < planar_polygon.getContour ().size (); ++i)
84  {
85  poly_points->SetPoint (i, planar_polygon.getContour ()[i].x,
86  planar_polygon.getContour ()[i].y,
87  planar_polygon.getContour ()[i].z);
88  polygon->GetPointIds ()->SetId (i, i);
89  }
90 
91  poly_points->SetPoint (i, planar_polygon.getContour ()[0].x,
92  planar_polygon.getContour ()[0].y,
93  planar_polygon.getContour ()[0].z);
94  polygon->GetPointIds ()->SetId (i, i);
95 
96  allocVtkUnstructuredGrid (poly_grid);
97  poly_grid->Allocate (1, 1);
98  poly_grid->InsertNextCell (polygon->GetCellType (), polygon->GetPointIds ());
99  poly_grid->SetPoints (poly_points);
100  poly_grid->Update ();
101 
102  return (poly_grid);
103 }
104