1 // trinodes.cxx -- "Triangle" nodes management class
3 // Written by Curtis Olson, started March 1999.
5 // Copyright (C) 1999 Curtis L. Olson - curt@flightgear.org
7 // This program is free software; you can redistribute it and/or
8 // modify it under the terms of the GNU General Public License as
9 // published by the Free Software Foundation; either version 2 of the
10 // License, or (at your option) any later version.
12 // This program is distributed in the hope that it will be useful, but
13 // WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 // General Public License for more details.
17 // You should have received a copy of the GNU General Public License
18 // along with this program; if not, write to the Free Software
19 // Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 // (Log is kept at end of this file)
25 #include "trinodes.hxx"
29 FGTriNodes::FGTriNodes( void ) {
34 FGTriNodes::~FGTriNodes( void ) {
38 // return true of the two points are "close enough" as defined by
39 // FG_PROXIMITY_EPSILON
40 inline bool FGTriNodes::close_enough( const Point3D& p1, const Point3D& p2 ) {
41 if ( ( fabs(p1.x() - p2.x()) < FG_PROXIMITY_EPSILON ) &&
42 ( fabs(p1.y() - p2.y()) < FG_PROXIMITY_EPSILON ) ) {
50 // Add a point to the point list if it doesn't already exist. Returns
51 // the index (starting at zero) of the point in the list.
52 int FGTriNodes::unique_add( const Point3D& p ) {
53 point_iterator current, last;
56 // see if point already exists
57 current = point_list.begin();
58 last = point_list.end();
59 for ( ; current != last; ++current ) {
60 if ( close_enough(p, *current) ) {
68 point_list.push_back( p );
75 // Revision 1.1 1999/03/17 23:52:00 curt