$search
00001 /* 00002 * Software License Agreement (BSD License) 00003 * 00004 * Copyright (c) 2010, Willow Garage, Inc. 00005 * All rights reserved. 00006 * 00007 * Redistribution and use in source and binary forms, with or without 00008 * modification, are permitted provided that the following conditions 00009 * are met: 00010 * 00011 * * Redistributions of source code must retain the above copyright 00012 * notice, this list of conditions and the following disclaimer. 00013 * * Redistributions in binary form must reproduce the above 00014 * copyright notice, this list of conditions and the following 00015 * disclaimer in the documentation and/or other materials provided 00016 * with the distribution. 00017 * * Neither the name of Willow Garage, Inc. nor the names of its 00018 * contributors may be used to endorse or promote products derived 00019 * from this software without specific prior written permission. 00020 * 00021 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 00022 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00023 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 00024 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 00025 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 00026 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 00027 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 00028 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00029 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00030 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 00031 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00032 * POSSIBILITY OF SUCH DAMAGE. 00033 * 00034 * $Id: pcd_concatenate_points.cpp 30719 2010-07-09 20:28:41Z rusu $ 00035 * 00036 */ 00037 00046 #include "pcl/io/pcd_io.h" 00047 #include "pcl/point_types.h" 00048 00049 /* ---[ */ 00050 int 00051 main (int argc, char** argv) 00052 { 00053 pcl::PointCloud<pcl::PointXYZ> cloud_a, cloud_b, cloud_c; 00054 00055 // Fill in the cloud data 00056 cloud_a.width = 5; 00057 cloud_b.width = 3; 00058 cloud_a.height = cloud_b.height = 1; 00059 cloud_a.points.resize (cloud_a.width * cloud_a.height); 00060 cloud_b.points.resize (cloud_b.width * cloud_b.height); 00061 00062 for (size_t i = 0; i < cloud_a.points.size (); ++i) 00063 { 00064 cloud_a.points[i].x = 1024 * rand () / (RAND_MAX + 1.0); 00065 cloud_a.points[i].y = 1024 * rand () / (RAND_MAX + 1.0); 00066 cloud_a.points[i].z = 1024 * rand () / (RAND_MAX + 1.0); 00067 } 00068 00069 for (size_t i = 0; i < cloud_b.points.size (); ++i) 00070 { 00071 cloud_b.points[i].x = 1024 * rand () / (RAND_MAX + 1.0); 00072 cloud_b.points[i].y = 1024 * rand () / (RAND_MAX + 1.0); 00073 cloud_b.points[i].z = 1024 * rand () / (RAND_MAX + 1.0); 00074 } 00075 00076 std::cerr << "Cloud A: " << std::endl; 00077 for (size_t i = 0; i < cloud_a.points.size (); ++i) 00078 std::cerr << " " << cloud_a.points[i].x << " " << cloud_a.points[i].y << " " << cloud_a.points[i].z << std::endl; 00079 00080 std::cerr << "Cloud B: " << std::endl; 00081 for (size_t i = 0; i < cloud_b.points.size (); ++i) 00082 std::cerr << " " << cloud_b.points[i].x << " " << cloud_b.points[i].y << " " << cloud_b.points[i].z << std::endl; 00083 00084 // Copy the point cloud data 00085 cloud_c = cloud_a; 00086 cloud_c += cloud_b; 00087 00088 std::cerr << "Cloud C: " << std::endl; 00089 for (size_t i = 0; i < cloud_c.points.size (); ++i) 00090 std::cerr << " " << cloud_c.points[i].x << " " << cloud_c.points[i].y << " " << cloud_c.points[i].z << " " << std::endl; 00091 00092 return (0); 00093 } 00094 /* ]--- */