Hello,

I am trying to construct a winged-edge representation of a mesh with Euler

operators, given a mesh in the "simple" form, i.e. vertex list and list

of polygons with indices to the vertex list.

Most winged-edge source code references on the net refer to Ian

Ashdown's public code package, so that is what I am using. He provides the

following operators:

BOOL JoinEdgeKillVertex( WEdge *, WEdge *, WVert * );

BOOL KillEdgeFace( WEdge *, WFace * );

BOOL KillEdgeVertex( WEdge *, WVert * );

BOOL KillVertexFace();

BOOL MakeEdgeFace( WVert *, WVert *, WFace *, WEdge **,WFace ** );

BOOL MakeEdgeVertex( WFace *, WVert *, Point3 &, WEdge **, WVert ** );

BOOL MakeVertexFace( Point3 &, WVert **, WFace ** );

BOOL SplitEdgeMakeVertex( WEdge *, Point3 &, WEdge **,WVert ** );

Now, my concern is how do I use those operators to easily construct my

winged-edge representation of a mesh from the standard vertex and polygon

lists? I took a look at the original Baumgart papers from the 70's, he

does explain the operators thouroughly but I am still completely missing

the info on using them in mesh construction.

It seems to me as if I needed adjacency and membership relationships ( =

topology data) in order to construct the winged-edge representation.. but

that is why I am constructing it in the first place, to have access to the

topological data :).

I am sure everyone dealing with winged-edges has done this before, so any

help is appreciated.

Regards,

Pawel Defee

--

***************************************************************************

Pawel Defee

***************************************************************************