From Geoff Michel, added support for constrain delaunay triangultion, and osgdelaunay example.
This commit is contained in:
@@ -14,22 +14,96 @@
|
||||
#ifndef OSGUTIL_DELAUNAYTRIANGULATOR_
|
||||
#define OSGUTIL_DELAUNAYTRIANGULATOR_
|
||||
|
||||
#include <list>
|
||||
|
||||
#include <osg/ref_ptr>
|
||||
#include <osg/Array>
|
||||
#include <osg/Referenced>
|
||||
#include <osg/CopyOp>
|
||||
#include <osg/PrimitiveSet>
|
||||
#include <osg/Geometry>
|
||||
|
||||
#include <osgUtil/Export>
|
||||
|
||||
namespace osgUtil
|
||||
{
|
||||
|
||||
/** Utility class that triangulates an irregular network of sample points.
|
||||
/** DelaunayTriangulator: Utility class that triangulates an irregular network of sample points.
|
||||
Just create a DelaunayTriangulator, assign it the sample point array and call
|
||||
its triangulate() method to start the triangulation. Then you can obtain the
|
||||
generated primitive by calling the getTriangles() method.
|
||||
|
||||
Add DelaunayConstraints (or derived class) to control the triangulation edges.
|
||||
*/
|
||||
class OSGUTIL_EXPORT DelaunayConstraint: public osg::Geometry {
|
||||
// controls the edges in a Delaunay triangulation.
|
||||
// constraints can be linear (with width), areal (contains an area)
|
||||
// uses: to replace part of a terrain with an alternative textured model (roads, lakes).
|
||||
// the primitive sets in this are either LINE_LOOP or LINE_STRIP
|
||||
public:
|
||||
DelaunayConstraint() { }
|
||||
|
||||
/** Each primitiveset is a list of vertices which may be closed by joining up to its start
|
||||
* to make a loop. Constraints should be simple lines, not crossing themselves.
|
||||
* Constraints which cross other constraints can cause difficulties - see the example
|
||||
* for methods of dealing with them. */
|
||||
|
||||
/** collect up indices of triangle from delaunay triangles.
|
||||
* The delaunay triangles inside the DelaunayConstraint area can be used to fill
|
||||
* the area or generate geometry that terrain follows the area in some way.
|
||||
* These triangles can form a canopy or a field. */
|
||||
void addtriangle(const int i1,const int i2, const int i3);
|
||||
|
||||
/** Get the filling primitive. One:
|
||||
* triangulate must have bneen called and
|
||||
* two: triangle list is filled when
|
||||
* DelaunayTriangulator::removeInternalTriangles is called.
|
||||
* These return the triangles removed from the delaunay triangulation by
|
||||
* DelaunayTriangulator::removeInternalTriangles. */
|
||||
inline const osg::DrawElementsUInt *getTriangles() const;
|
||||
inline osg::DrawElementsUInt *getTriangles();
|
||||
|
||||
/** Call BEFORE makeDrawable to reorder points to make optimised set
|
||||
*/
|
||||
osg::Vec3Array *getPoints(const osg::Vec3Array *points);
|
||||
|
||||
/** converts simple list of triangles into a drawarray.
|
||||
*/
|
||||
osg::DrawElementsUInt *makeDrawable();
|
||||
|
||||
/** Add vertices and constraint loops from dco
|
||||
* Can be used to generate extra vertices where dco crosses 'this' using
|
||||
* osgUtil::tesselator to insert overlap vertices.
|
||||
*/
|
||||
void merge(DelaunayConstraint *dco);
|
||||
|
||||
/** remove from line the vertices that are inside dco
|
||||
*/
|
||||
void removeVerticesInside(const DelaunayConstraint *dco);
|
||||
|
||||
/** return winding number as a float of loop around testpoint; may use multiple loops
|
||||
* does not reject points on the edge or very very close to the edge */
|
||||
float windingNumber(const osg::Vec3 testpoint) const ;
|
||||
|
||||
/** true if testpoint is internal (or external) to constraint. */
|
||||
virtual bool contains(const osg::Vec3 testpoint) const;
|
||||
virtual bool outside(const osg::Vec3 testpoint) const;
|
||||
|
||||
/** Tesselate the constraint loops so that the crossing points are interpolated
|
||||
* and added to the contraints for the triangulation. */
|
||||
void DelaunayConstraint::handleOverlaps(void);
|
||||
|
||||
protected:
|
||||
virtual ~DelaunayConstraint() {}
|
||||
|
||||
typedef std::vector< int* > trilist; // array of indices in points array defining triangles
|
||||
|
||||
trilist _interiorTris; // list of triangles that fits the area.
|
||||
|
||||
osg::ref_ptr<osg::DrawElementsUInt> prim_tris_; // returns a PrimitiveSet to draw the interior of this DC
|
||||
};
|
||||
|
||||
|
||||
class OSGUTIL_EXPORT DelaunayTriangulator: public osg::Referenced {
|
||||
public:
|
||||
|
||||
@@ -37,6 +111,8 @@ public:
|
||||
explicit DelaunayTriangulator(osg::Vec3Array *points, osg::Vec3Array *normals = 0);
|
||||
DelaunayTriangulator(const DelaunayTriangulator ©, const osg::CopyOp ©op = osg::CopyOp::SHALLOW_COPY);
|
||||
|
||||
typedef std::vector< osg::ref_ptr<DelaunayConstraint> > linelist;
|
||||
|
||||
/** Get the const input point array. */
|
||||
inline const osg::Vec3Array *getInputPointArray() const;
|
||||
|
||||
@@ -46,6 +122,17 @@ public:
|
||||
/** Set the input point array. */
|
||||
inline void setInputPointArray(osg::Vec3Array *points);
|
||||
|
||||
/** Add an input constraint loop.
|
||||
** the edges of the loop will constrain the triangulation.
|
||||
** if remove!=0, the internal triangles of the constraint will be removed;
|
||||
** the user may the replace the constraint line with an equivalent geometry.
|
||||
** GWM July 2005 */
|
||||
void addInputConstraint(DelaunayConstraint *dc) {
|
||||
constraint_lines.push_back(dc);
|
||||
return;
|
||||
}
|
||||
|
||||
|
||||
/** Get the const output normal array (optional). */
|
||||
inline const osg::Vec3Array *getOutputNormalArray() const;
|
||||
|
||||
@@ -63,15 +150,24 @@ public:
|
||||
|
||||
/** Get the generated primitive (call triangulate() first). */
|
||||
inline osg::DrawElementsUInt *getTriangles();
|
||||
|
||||
/** remove the triangles internal to the constraint loops.
|
||||
* (Line strips cannot remove any internal triangles). */
|
||||
void removeInternalTriangles(DelaunayConstraint *constraint);
|
||||
|
||||
protected:
|
||||
virtual ~DelaunayTriangulator();
|
||||
DelaunayTriangulator &operator=(const DelaunayTriangulator &) { return *this; }
|
||||
int getindex(const osg::Vec3 pt,const osg::Vec3Array *points);
|
||||
|
||||
private:
|
||||
osg::ref_ptr<osg::Vec3Array> points_;
|
||||
osg::ref_ptr<osg::Vec3Array> normals_;
|
||||
osg::ref_ptr<osg::DrawElementsUInt> prim_tris_;
|
||||
|
||||
// GWM these lines provide required edges in the triangulated shape.
|
||||
linelist constraint_lines;
|
||||
|
||||
};
|
||||
|
||||
// INLINE METHODS
|
||||
@@ -116,6 +212,18 @@ inline osg::DrawElementsUInt *DelaunayTriangulator::getTriangles()
|
||||
return prim_tris_.get();
|
||||
}
|
||||
|
||||
inline const osg::DrawElementsUInt *DelaunayConstraint::getTriangles() const
|
||||
{
|
||||
return prim_tris_.get();
|
||||
}
|
||||
|
||||
inline osg::DrawElementsUInt *DelaunayConstraint::getTriangles()
|
||||
{
|
||||
return prim_tris_.get();
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
Reference in New Issue
Block a user