mi.C

Go to the documentation of this file.

#include "mi.H"

Bface_list
leading_faces(CBvert* v, CSimplexFilter& filter)
{
   // return a list of faces, one face per sector in the
   // "star" around v, where sectors separated by edges
   //  accpted by the filter (or by border edges):

   Bface_list ret;
   if (!v)
      return ret;

   Bface* f = 0;
   for (int i=0; i<v->degree(); i++) {
      Bedge* e = v->e(i);
      if ((e->is_border() || filter.accept(e)) &&
          (f = e->ccw_face((Bvert*)v))) // XXX - fix Bedge::ccw_face()
         ret += f;
         
   }
   // if no edges are accepted by the filter and there are no border
   // edges, add in any old face:
   if (ret.empty() && v->get_face())
      ret += v->get_face();

   return ret;
}

Wvec
vert_normal(CBvert* v, CBface* f, CSimplexFilter& filter)
{
   assert(v && f && f->contains(v));

   if (v->degree(filter) < 2)
      return v->norm();

   Wvec ret;
   Bedge* e=0;
   Bface* cur = rewind_cw(v, f, filter);
   do {
      ret += weighted_vnorm(cur, v);
   } while (
      (e = cur->edge_before_vert(v)) &&
      (cur = e->other_face(cur)) &&
      !filter.accept(e)
      );
   return ret.normalized();
}

// end of file mi.C

---