00001 /**************************************************************************** 00002 Copyright (C)2003 David Jung <opensim@pobox.com> 00003 00004 This program/file is free software; you can redistribute it and/or modify 00005 it under the terms of the GNU General Public License as published by 00006 the Free Software Foundation; either version 2 of the License, or 00007 (at your option) any later version. 00008 00009 This program is distributed in the hope that it will be useful, 00010 but WITHOUT ANY WARRANTY; without even the implied warranty of 00011 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00012 GNU General Public License for more details. (http://www.gnu.org) 00013 00014 You should have received a copy of the GNU General Public License 00015 along with this program; if not, write to the Free Software 00016 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 00017 00018 $Id: Disc3.cpp 1030 2004-02-11 20:46:17Z jungd $ 00019 $Revision: 1.1 $ 00020 $Date: 2004-02-11 15:46:17 -0500 (Wed, 11 Feb 2004) $ 00021 $Author: jungd $ 00022 00023 ****************************************************************************/ 00024 00025 #include <math.h> 00026 00027 #include <gfx/Disc3> 00028 00029 using gfx::Disc3; 00030 00031 using base::Point3; 00032 using gfx::Segment3; 00033 00034 00035 Point3 Disc3::pointClosestTo(const Point3& p) const 00036 { 00037 // Algorithm from Magic Software web-site ( http://www.magic-software.com/ ) 00038 Point3 q = p - dot(n,p-o)*n; // projection of p onto the plane 00039 Vector3 oq = q-o; 00040 Real l = oq.length(); 00041 if (l < r) // q is within disc 00042 return q; 00043 else { 00044 // q falls outside disc, so closest point in on the boundary circle 00045 return o+(r*oq)/l; 00046 } 00047 } 00048 00049 00050 00051 00052 Segment3 Disc3::shortestSegmentBetween(const Segment3& s) const 00053 { 00054 Unimplemented; 00055 }