arcsconnected Class Reference

A container of arcs that can have vector of arcs saved and restored. More...

#include <arcsconnected.h>

Collaboration diagram for arcsconnected:

List of all members.

Public Member Functions
	arcsconnected (uintc nstates, uintc N_)
	Hold n states, each of which have N arcs.
void	sumdisttoarc (double &sum, vector< pt2 > const &qi) const
	A sum of the distance squared from a control point to the nearest arc.
void	constructR0 (doublec r0, vector< pt2 > const &pts)
	From a starting radius construct arcs through consecutive points.
void	constructR0 (doublec r0, doublec *pts)
	Assumes pts is a (N+1)*2 array of doubles.
void	constructPhi0 (doublec phi0, vector< pt2 > const &pts)
	From a starting angle(radians) construct arcs through consecutive points.
void	arcwriter (stringc filename) const
	Write vi out to a file.
Public Attributes
uintc	N
	The number of arcs.
cirbuffarr< arc >	cb
	Circular buffer used to store previous states.
vector< arc >	vi
	The current state.

---

Detailed Description

A container of arcs that can have vector of arcs saved and restored.

Support for constructing connected arcs from initial points is provided. The arcs are connected with C1 continuity if both sides of the point are arcs.

Definition at line 20 of file arcsconnected.h.

---

Constructor & Destructor Documentation

arcsconnected::arcsconnected	(	uintc	nstates,
		uintc	N_
	)

Hold n states, each of which have N arcs.

Definition at line 89 of file arcsconnected.cpp.

References N, and vi.

  : N(_N), cb(nstates,_N)
{
  vi.resize(N);
  constructR0Vec.resize(N+1);
}

---

Member Function Documentation

void arcsconnected::arcwriter

(

stringc

filename

)

const

Write vi out to a file.

Definition at line 97 of file arcsconnected.cpp.

References N, and vi.

Referenced by test07().

{
  ofstream targ(filename.c_str(),ios::trunc);

  assert(targ.good()==true);
  if (targ.good()==false)
    return;

  targ << N+1 << endl;
  for (uint i=0; i<N; ++i)
    targ << vi[i].p0 << endl;
  targ << vi[N-1].p1 << endl;

  targ << N << endl;
  for (uint i=0; i<N ; ++i)
    targ << i << " " << i+1 << " " << vi[i].radius << endl;

}

void arcsconnected::constructPhi0	(	doublec	phi0,
		vector< pt2 > const &	pts
	)

From a starting angle(radians) construct arcs through consecutive points.

Definition at line 9 of file arcsconnected.cpp.

References arc::constructPhi0TwoPoints(), and arc::radius.

Referenced by arcprob::solveInitialCondition().

{
  assert(pts.size()==N+1);
  assert(pts.size()>=2);
  if (pts.size()<2)
    return;

  arc a;
  a.constructPhi0TwoPoints(phi0,pts[0],pts[1]);
  double r0 = a.radius;

  constructR0(r0,pts);
}

void arcsconnected::constructR0	(	doublec	r0,
		doublec *	pts
	)

Assumes pts is a (N+1)*2 array of doubles.

Definition at line 27 of file arcsconnected.cpp.

References point2< T >::x.

{
  pt2 * v = & constructR0Vec[0];
  pt2 * const vend = v + N + 1;
  doublec *p = pts;
  for ( ; v!=vend; )
  {
    (*v).x = *p;
    ++p;
    (*v).y = *p;
    ++p;
    ++v;
  }

  constructR0(r0,constructR0Vec);

  //assert(false) // UNTESTED ROUTINE<TODO>
}

void arcsconnected::constructR0	(	doublec	r0,
		vector< pt2 > const &	pts
	)

From a starting radius construct arcs through consecutive points.

Definition at line 50 of file arcsconnected.cpp.

{
  assert(pts.size()==N+1);
  assert(pts.size()>=2);
  if (pts.size()<2)
    return;

  vi[0].constructRadiusTwoPoints(r0,pts[0],pts[1]);

  double theta;
  for (uint i=1; i<N; ++i)
  {
    pt2c & p0(pts[i]);
    pt2c & p1(pts[i+1]);
    pt2c & c0(vi[i-1].center);

    theta = vi[i-1].phi1;

//cout << SHOW(theta*radtodeg) << endl;

    // Is the new point above the tangent?
    // This is a halfspace test.
    if ( (p0-c0).dot(p1-p0) > 0.0 )
    {
      theta += PI;
      if (theta >= PI*2.0)
        theta -= PI*2.0;
    }

//cout << SHOW(theta*radtodeg) << endl;
      
    vi[i].constructPhi0TwoPoints(theta,pts[i],pts[i+1]);
  }
}

void arcsconnected::sumdisttoarc	(	double &	sum,
		vector< pt2 > const &	qi
	)			const

A sum of the distance squared from a control point to the nearest arc.

Definition at line 117 of file arcsconnected.cpp.

References arc::distanceSquared().

{
  uintc W = qi.size();

  sum=0.0;
  double val;
  double val2;
  for (uint i=0; i<N; ++i)
  {
    arc const & a(vi[i]);
    a.distanceSquared(val,qi[0]);

    for (uint k=0; k<W; ++k)
    {
      a.distanceSquared(val2,qi[k]);
      if (val2<val)
        val=val2;
    }

    sum += val;
  }
}

---

Member Data Documentation

cirbuffarr<arc> arcsconnected::cb

Circular buffer used to store previous states.

Definition at line 30 of file arcsconnected.h.

uintc arcsconnected::N

The number of arcs.

Definition at line 27 of file arcsconnected.h.

Referenced by arcsconnected(), arcwriter(), and arcprob::solveInitialCondition().

vector<arc> arcsconnected::vi

The current state.

Definition at line 36 of file arcsconnected.h.

Referenced by arcsconnected(), arcwriter(), and test07().

---

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

• arcs/arcsconnected.h
• arcs/arcsconnected.cpp