dolfin team mailing list archive

[Matthew Knepley <knepley@xxxxxxxxx>]

On Tue, Apr 28, 2009 at 4:03 PM, Jed Brown <jed@xxxxxxxx> wrote:

> Matthew Knepley wrote:
>
> > Yes, this is what I meant. It seems like this will only work for
> simplices?
>
> It works fine for the whole zoo.  You need to assign a canonical
> ordering of vertices and canonical ordering+orientation for downward
> adjacencies.  Then entities are completely described by their topology
> and vertex connectivity.
>
> A full description and API:
>
>  http://www.mcs.anl.gov/uploads/cels/papers/P1573A.pdf


Really? This is ugly. It is not an algorithm, it is just sticking a whole
bunch of
known shapes into a database. We have a real algorithm that can compute all
this on the fly with simple rules.

  Matt


>
> Jed
>
>
> _______________________________________________
> DOLFIN-dev mailing list
> DOLFIN-dev@xxxxxxxxxx
> http://www.fenics.org/mailman/listinfo/dolfin-dev
>
>


-- 
What most experimenters take for granted before they begin their experiments
is infinitely more interesting than any results to which their experiments
lead.
-- Norbert Wiener