1
0
Fork 0
flightgear/Triangulate/trisegs.hxx

84 lines
2 KiB
C++
Raw Normal View History

1999-03-20 13:21:36 +00:00
// trisegs.hxx -- "Triangle" segment management class
//
// Written by Curtis Olson, started March 1999.
//
// Copyright (C) 1999 Curtis L. Olson - curt@flightgear.org
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; either version 2 of the
// License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
//
// $Id$
// (Log is kept at end of this file)
#ifndef _TRISEGS_HXX
#define _TRISEGS_HXX
#ifndef __cplusplus
# error This library requires C++
#endif
#include <Include/compiler.h>
#include <vector>
FG_USING_STD(vector);
// a segment is two integer pointers into the node list
class FGTriSeg {
public:
int n1, n2;
};
typedef vector < FGTriSeg > triseg_list;
typedef triseg_list::iterator triseg_list_iterator;
typedef triseg_list::const_iterator const_triseg_list_iterator;
class FGTriSegments {
private:
triseg_list seg_list;
public:
// Constructor and destructor
FGTriSegments( void );
~FGTriSegments( void );
// Add a point to the point list if it doesn't already exist.
// Returns the index (starting at zero) of the point in the list.
int unique_add( const FGTriSeg& s );
// return the master node list
inline triseg_list get_seg_list() const { return seg_list; }
// return the ith segment
inline FGTriSeg get_seg( int i ) const { return seg_list[i]; }
};
#endif // _TRISEGS_HXX
// $Log$
// Revision 1.1 1999/03/20 13:21:36 curt
// Initial revision.
//