00001 // -*- mode: c++ -*- 00002 /********************************************************************* 00003 * Software License Agreement (BSD License) 00004 * 00005 * Copyright (c) 2015, JSK Lab 00006 * All rights reserved. 00007 * 00008 * Redistribution and use in source and binary forms, with or without 00009 * modification, are permitted provided that the following conditions 00010 * are met: 00011 * 00012 * * Redistributions of source code must retain the above copyright 00013 * notice, this list of conditions and the following disclaimer. 00014 * * Redistributions in binary form must reproduce the above 00015 * copyright notice, this list of conditions and the following 00016 * disclaimer in the documentation and/o2r other materials provided 00017 * with the distribution. 00018 * * Neither the name of the JSK Lab nor the names of its 00019 * contributors may be used to endorse or promote products derived 00020 * from this software without specific prior written permission. 00021 * 00022 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 00023 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00024 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 00025 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 00026 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 00027 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 00028 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 00029 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00030 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00031 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 00032 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00033 * POSSIBILITY OF SUCH DAMAGE. 00034 *********************************************************************/ 00035 00036 #include "jsk_footstep_planner/line2d.h" 00037 00038 namespace jsk_footstep_planner 00039 { 00040 Line2D::Line2D(const Eigen::Vector3f& p, const Eigen::Vector3f& q): 00041 u_(p[0], p[1]), v_(q[0], q[1]) 00042 { 00043 } 00044 00045 bool Line2D::isCrossing(Line2D& other) 00046 { 00047 const float d = ((v_[0] - u_[0]) * (other.v_[1] - other.u_[1]) 00048 - (v_[1] - u_[1]) * (other.v_[0] - other.u_[0])); 00049 if (d == 0) { // parallel 00050 return false; 00051 } 00052 const float u = ((other.u_[0] - u_[0])*(other.v_[1] - other.u_[1]) 00053 - (other.u_[1] - u_[1])*(other.v_[0] - other.u_[0]))/d; 00054 const float v = ((other.u_[0] - u_[0])*(v_[1] - u_[1]) 00055 - (other.u_[1] - u_[1])*(v_[0] - u_[0]))/d; 00056 if (u < 0.0 || u > 1.0) { 00057 return false; 00058 } 00059 if (v < 0.0 || v > 1.0) { 00060 return false; 00061 } 00062 return true; 00063 } 00064 } 00065