00001 /********************************************************************* 00002 * Software License Agreement (BSD License) 00003 * 00004 * Copyright (c) 2013, 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 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 00035 /* Author: Acorn Pooley */ 00036 00037 #include <moveit/distance_field/find_internal_points.h> 00038 00039 void distance_field::findInternalPointsConvex( 00040 const bodies::Body& body, 00041 double resolution, 00042 EigenSTL::vector_Vector3d& points) 00043 { 00044 bodies::BoundingSphere sphere; 00045 body.computeBoundingSphere(sphere); 00046 double xval_s = std::floor((sphere.center.x() - sphere.radius - resolution) / resolution) * resolution; 00047 double yval_s = std::floor((sphere.center.y() - sphere.radius - resolution) / resolution) * resolution; 00048 double zval_s = std::floor((sphere.center.z() - sphere.radius - resolution) / resolution) * resolution; 00049 double xval_e = sphere.center.x() + sphere.radius + resolution; 00050 double yval_e = sphere.center.y() + sphere.radius + resolution; 00051 double zval_e = sphere.center.z() + sphere.radius + resolution; 00052 Eigen::Vector3d pt; 00053 for(pt.x() = xval_s; pt.x() <= xval_e; pt.x() += resolution) { 00054 for(pt.y() = yval_s; pt.y() <= yval_e; pt.y() += resolution) { 00055 for(pt.z() = zval_s; pt.z() <= zval_e; pt.z() += resolution) { 00056 if(body.containsPoint(pt)) { 00057 points.push_back(pt); 00058 } 00059 } 00060 } 00061 } 00062 } 00063