Files
create/src/Mod/Mesh/App/WildMagic4/Wm4ConvexHull2.h

97 lines
2.9 KiB
C++

// Geometric Tools, LLC
// Copyright (c) 1998-2010
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
//
// File Version: 4.10.0 (2009/11/18)
#ifndef WM4CONVEXHULL2_H
#define WM4CONVEXHULL2_H
#include "Wm4FoundationLIB.h"
#include "Wm4ConvexHull1.h"
#include "Wm4Query2.h"
namespace Wm4
{
template <class Real>
class WM4_FOUNDATION_ITEM ConvexHull2 : public ConvexHull<Real>
{
public:
// The input to the constructor is the array of vertices whose convex hull
// is required. If you want ConvexHull2 to delete the vertices during
// destruction, set bOwner to 'true'. Otherwise, you own the vertices and
// must delete them yourself.
//
// You have a choice of speed versus accuracy. The fastest choice is
// Query::QT_INT64, but it gives up a lot of precision, scaling the points
// to [0,2^{20}]^3. The choice Query::QT_INTEGER gives up less precision,
// scaling the points to [0,2^{24}]^3. The choice Query::QT_RATIONAL uses
// exact arithmetic, but is the slowest choice. The choice Query::QT_REAL
// uses floating-point arithmetic, but is not robust in all cases.
ConvexHull2 (int iVertexQuantity, Vector2<Real>* akVertex, Real fEpsilon,
bool bOwner, Query::Type eQueryType);
virtual ~ConvexHull2 ();
// If GetDimension() returns 1, then the points lie on a line. You must
// create a ConvexHull1 object using the function provided.
const Vector2<Real>& GetLineOrigin () const;
const Vector2<Real>& GetLineDirection () const;
ConvexHull1<Real>* GetConvexHull1 () const;
private:
using ConvexHull<Real>::m_eQueryType;
using ConvexHull<Real>::m_iVertexQuantity;
using ConvexHull<Real>::m_iDimension;
using ConvexHull<Real>::m_iSimplexQuantity;
using ConvexHull<Real>::m_aiIndex;
using ConvexHull<Real>::m_fEpsilon;
using ConvexHull<Real>::m_bOwner;
class WM4_FOUNDATION_ITEM Edge
{
public:
Edge (int iV0, int iV1);
int GetSign (int i, const Query2<Real>* pkQuery);
void Insert (Edge* pkAdj0, Edge* pkAdj1);
void DeleteSelf ();
void DeleteAll ();
void GetIndices (int& riHQuantity, int*& raiHIndex);
int V[2];
Edge* A[2];
int Sign;
int Time;
};
// Support for streaming to/from disk.
ConvexHull2 (const char* acFilename);
bool Load (const char* acFilename);
bool Save (const char* acFilename) const;
bool Update (Edge*& rpkHull, int i);
// The input points.
Vector2<Real>* m_akVertex;
// Support for robust queries.
Vector2<Real>* m_akSVertex;
Query2<Real>* m_pkQuery;
// The line of containment if the dimension is 1.
Vector2<Real> m_kLineOrigin, m_kLineDirection;
};
typedef ConvexHull2<float> ConvexHull2f;
typedef ConvexHull2<double> ConvexHull2d;
}
#endif