/**********************************************************************
 * $Id: InteriorPointPoint.h 1820 2006-09-06 16:54:23Z mloskot $
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.refractions.net
 *
 * Copyright (C) 2005-2006 Refractions Research Inc.
 * Copyright (C) 2001-2002 Vivid Solutions Inc.
 *
 * This is free software; you can redistribute and/or modify it under
 * the terms of the GNU Lesser General Public Licence as published
 * by the Free Software Foundation. 
 * See the COPYING file for more information.
 *
 **********************************************************************/

#ifndef GEOS_ALGORITHM_INTERIORPOINTPOINT_H
#define GEOS_ALGORITHM_INTERIORPOINTPOINT_H

#include <geos/geom/Coordinate.h>

// Forward declarations
namespace geos {
	namespace geom {
		class Geometry;
	}
}

namespace geos {
namespace algorithm { // geos::algorithm

/**
 * \class InteriorPointPoint geosAlgorithm.h geos/geosAlgorithm.h
 * \brief
 * Computes a point in the interior of an point geometry.
 *
 * Algorithm:
 *
 * Find a point which is closest to the centroid of the geometry.
 */
class InteriorPointPoint {
private:

	bool hasInterior;

	geom::Coordinate centroid;

	double minDistance;

	geom::Coordinate interiorPoint;

	/**
	 * Tests the point(s) defined by a Geometry for the best inside point.
	 * If a Geometry is not of dimension 0 it is not tested.
	 * @param geom the geometry to add
	 */
	void add(const geom::Geometry *geom);

	void add(const geom::Coordinate *point);

public:

	InteriorPointPoint(const geom::Geometry *g);

	~InteriorPointPoint() {}

	bool getInteriorPoint(geom::Coordinate& ret) const;

};

} // namespace geos::algorithm
} // namespace geos


#endif // GEOS_ALGORITHM_INTERIORPOINTPOINT_H

/**********************************************************************
 * $Log$
 * Revision 1.1  2006/03/09 16:46:48  strk
 * geos::geom namespace definition, first pass at headers split
 *
 **********************************************************************/