delaunaysimpleD2< PT, PD, INDX > Class Template Reference

The simplest Delaunay triangulation algorithm in 2D. More...

#include <delaunaysimpleD2.h>

Inheritance diagram for delaunaysimpleD2< PT, PD, INDX >:

Collaboration diagram for delaunaysimpleD2< PT, PD, INDX >:

List of all members.

Public Member Functions
	delaunaysimpleD2 ()
	pts and vi have their first element as nulls.
void	get (PT &a, PT &b, PT &c, INDX const i) const
	Triangle verticies.
void	eval ()
	Construct tessellation.
Public Attributes
vector< PT >	pts
	List of points.
vector< simplexD2indexed< INDX > >	vi
	List of triangles.

---

Detailed Description

template<typename PT, typename PD, typename INDX>
class delaunaysimpleD2< PT, PD, INDX >

The simplest Delaunay triangulation algorithm in 2D.

O(n^4) complexity. Collinear points not tested for. Non-unique delaunay triangulations not tested for (presumably both possibilities are written).

Definition at line 20 of file delaunaysimpleD2.h.

---

Constructor & Destructor Documentation

template<typename PT , typename PD , typename INDX >

delaunaysimpleD2< PT, PD, INDX >::delaunaysimpleD2

(

)

[inline]

pts and vi have their first element as nulls.

Definition at line 51 of file delaunaysimpleD2.h.

References delaunaysimpleD2< PT, PD, INDX >::pts, and delaunaysimpleD2< PT, PD, INDX >::vi.

{
  pts.push_back(PT());
  vi.push_back( simplexD2indexed<INDX>() );
}

---

Member Function Documentation

template<typename PT , typename PD , typename INDX >

void delaunaysimpleD2< PT, PD, INDX >::eval

(

)

[inline]

Construct tessellation.

Definition at line 92 of file delaunaysimpleD2.h.

References delaunaysimpleD2< PT, PD, INDX >::pts.

Referenced by delaunaysimpleD2test::test01(), and delaunaysimpleD2test::test02().

{
  INDX const n=pts.size();
  INDX i,j,k;
  for (i=1; i<n-2; ++i)
  {
    for (j=i+1; j<n-1; ++j)
    {
      for (k=j+1; k<n; ++k)
      {
//cout << SHOW(i) << " " << SHOW(j) << " " << SHOW(k) << endl;
        evaluateTriangle(i,j,k);
      }
    }
  }

  //cout << print(vi,"\n") << endl;
}

template<typename PT, typename PD , typename INDX>

void delaunaysimpleD2< PT, PD, INDX >::get	(	PT &	a,
		PT &	b,
		PT &	c,
		INDX const	i
	)			const [inline]

Triangle verticies.

Definition at line 113 of file delaunaysimpleD2.h.

References simplexD2indexed< INDX >::pi, and pts.

{
  simplexD2indexed<INDX> const & t(vi[i]);
  
  a = pts[t.pi[0]];
  b = pts[t.pi[1]];
  c = pts[t.pi[2]];
}

---

Member Data Documentation

template<typename PT, typename PD, typename INDX>

vector< PT > delaunaysimpleD2< PT, PD, INDX >::pts

List of points.

Definition at line 34 of file delaunaysimpleD2.h.

Referenced by delaunaysimpleD2< PT, PD, INDX >::delaunaysimpleD2(), delaunaysimpleD2< PT, PD, INDX >::eval(), delaunaysimpleD2test::test01(), and delaunaysimpleD2test::test02().

template<typename PT, typename PD, typename INDX>

vector< simplexD2indexed<INDX> > delaunaysimpleD2< PT, PD, INDX >::vi

List of triangles.

Definition at line 36 of file delaunaysimpleD2.h.

Referenced by delaunaysimpleD2< PT, PD, INDX >::delaunaysimpleD2(), and delaunaysimpleD2test::test01().

---

The documentation for this class was generated from the following file:

• delaunay2D/delaunaysimpleD2.h