bounding_box.h 3.64 KB
Newer Older
Pierre Kraemer's avatar
Pierre Kraemer committed
1 2 3
/*******************************************************************************
 * CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
 * version 0.1                                                                  *
4
 * Copyright (C) 2009-2011, IGG Team, LSIIT, University of Strasbourg           *
Pierre Kraemer's avatar
Pierre Kraemer committed
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
 *                                                                              *
 * This library is free software; you can redistribute it and/or modify it      *
 * under the terms of the GNU Lesser General Public License as published by the *
 * Free Software Foundation; either version 2.1 of the License, or (at your     *
 * option) any later version.                                                   *
 *                                                                              *
 * This library 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 Lesser General Public License  *
 * for more details.                                                            *
 *                                                                              *
 * You should have received a copy of the GNU Lesser General Public License     *
 * along with this library; if not, write to the Free Software Foundation,      *
 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301 USA.           *
 *                                                                              *
20
 * Web site: http://cgogn.u-strasbg.fr/                                         *
Pierre Kraemer's avatar
Pierre Kraemer committed
21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106
 * Contact information: cgogn@unistra.fr                                        *
 *                                                                              *
 *******************************************************************************/

#ifndef __BOUNDING_BOX__
#define __BOUNDING_BOX__

namespace CGoGN
{

namespace Geom
{

/*
 * Class for the computation of bounding boxes
 */
template <typename VEC>
class BoundingBox
{
	public:
		/**********************************************/
		/*                CONSTRUCTORS                */
		/**********************************************/

		// must initialize the bounding box with one first point
		BoundingBox(const VEC& p);

		/**********************************************/
		/*                 ACCESSORS                  */
		/**********************************************/

		VEC& min();

		const VEC& min() const;

		VEC& max();

		const VEC& max() const;

		typename VEC::DATA_TYPE size(unsigned int coord) const;

		VEC center() const;

		/**********************************************/
		/*                 FUNCTIONS                  */
		/**********************************************/

		// add a point to the bounding box
		void addPoint(const VEC& p);

		// return true if bb intersects the bounding box
		bool intersects(const BoundingBox<VEC>& bb);

		// fusion with the given bounding box
		void fusion(const BoundingBox<VEC>& bb);

		/**********************************************/
		/*             STREAM OPERATORS               */
		/**********************************************/

//		friend std::ostream& operator<<(std::ostream& out, const BoundingBox<VEC>& bb);
//
//		friend std::istream& operator>>(std::istream& in, BoundingBox<VEC>& bb);


		friend std::ostream& operator<<(std::ostream& out, const BoundingBox<VEC>& bb)
		{
			out << bb.min() << " " << bb.max() ;
			return out ;
		}

		friend std::istream& operator>>(std::istream& in, BoundingBox<VEC>& bb)
		{
			in >> bb.min() >> bb.max() ;
			return in ;
		}

	private:
		VEC m_pMin, m_pMax ;
} ;

}
}

#include "bounding_box.hpp"
#endif