d4minboundary Class Reference

#include <d4minboundary.h>

Inheritance diagram for d4minboundary:

Collaboration diagram for d4minboundary:

List of all members.

Public Member Functions
	d4minboundary (d4tess &_tess)
bool const	eval (uintc a, uintc b)

---

Detailed Description

Definition at line 8 of file d4minboundary.h.

---

Constructor & Destructor Documentation

d4minboundary::d4minboundary

(

d4tess &

_tess

)

Definition at line 30 of file d4minboundary.cpp.

  : d4minoperator(_tess)
{
}

---

Member Function Documentation

bool const d4minboundary::eval	(	uintc	a,
		uintc	b
	)			[virtual]

Reimplemented from d4minoperator.

Definition at line 40 of file d4minboundary.cpp.

References d4tess::debugcheck(), d4tri::getclockwiseface(), d4tess::isconvex(), d4tri::ni, d4tri::niInverse(), d4tri::pi, d4tri::piInverse(), d4tess::pt, SHOW, d4minoperator::tess, trianglearea(), and d4tess::vi.

{
MessageGlobal mg;

  mg() << "a=" << a << " b=" << b << " convex " << tess.isconvex(a,b) << endl;

  if (tess.isconvex(a,b)==false)
    return false;

  uint aj[5];

  d4tri const A(tess.vi[a]);
  aj[0] = A.niInverse(b);

  d4tri const B(tess.vi[b]);
  aj[4] = B.niInverse(a);

  A.getclockwiseface(aj[1],aj[2],aj[3],aj[0]);

  uint pj[5];
  for (uint i=0; i<4; ++i)
    pj[i] = A.pi[aj[i]];
  pj[4] = B.pi[aj[4]];

for (uint i=0; i<5; ++i)
  mg() << "aj[" << i << "]=" << aj[i] << " ";
mg() << endl;
for (uint i=0; i<5; ++i)
  mg() << "pj[" << i << "]=" << pj[i] << " ";
mg() << endl;

  // Find which combination of tetrahedrons has 
  // the minimal boundary.

  // There are two possible tetrahedron permuations.
  // The current on has one inner partition through p0,p1,p2.
  //
  // The other permutation has three blades off line p0 to p4, to points p1,p2,p3.
  //
  // Choose the permutation with the minimum boundary area.

  double area1;
  trianglearea
  (
    area1,
    tess.pt[pj[1]],
    tess.pt[pj[2]],
    tess.pt[pj[3]]
  );

mg() << SHOW(area1) << endl;

  double area2=0.0;

  double area;

  for (uint i=1; i<4; ++i)
  {
    trianglearea
    (
      area,
      tess.pt[pj[4]],
      tess.pt[pj[i]],
      tess.pt[pj[0]]
    );

    area2 += area;
  }

mg() << SHOW(area2) << endl;

  if (area1<area2)
    return false;

mg() << "FUCK" << endl;


  // nj[0] is ignored.
  // the indexes correspond with the points : the neighbour is opposite the point
  // with the same index.  For neighbours >3 simply subtract 3 and that is the
  // index for the second tetrahedron.
  uint nj[7];
  
  for (uint i=1; i<=3; ++i)
    nj[i] = A.ni[aj[i]];

  for (uint i=4; i<=6; ++i)
    nj[i] = B.ni[ B.piInverse(pj[i-3]) ];

for (uint i=1; i<=6; ++i)
  mg() << "nj[" << i << "]=" << nj[i] << " ";
mg() << endl;

  uint k1(a), k2(b), k3(tess.vi.size());

  tess.vi[a] = d4tri( pj[4],pj[2],pj[0],pj[3], nj[1],k3,nj[4],k2 );
  tess.vi[b] = d4tri( pj[4],pj[0],pj[2],pj[1], nj[3],nj[6],k3,k1 );
  tess.vi.push_back( d4tri( pj[4],pj[0],pj[1],pj[3], nj[2],nj[5],k1,k2 ) );

  if (nj[1]!=0)
    tess.vi[nj[1]].niReset(a,k1);
  if (nj[2]!=0)
    tess.vi[nj[2]].niReset(a,k3);
  if (nj[3]!=0)
    tess.vi[nj[3]].niReset(a,k2);
  if (nj[4]!=0)
    tess.vi[nj[4]].niReset(b,k1);
  if (nj[5]!=0)
    tess.vi[nj[5]].niReset(b,k3);
  if (nj[6]!=0)
    tess.vi[nj[6]].niReset(b,k2);

  tess.debugcheck();

  return true;
}

---

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

• tetrahedron/d4minboundary.h
• tetrahedron/d4minboundary.cpp