Doubly connected edge list
= Doubly connected edge list
{wiki}
= DCEL
{c}
{synonym}
= Half-edge data structure
{synonym}
A mesh representation with two oppositely directed records per ordinary edge. Each record stores its origin <vertex of a polyhedron>, incident face, next face-boundary record and opposite record; previous records are often cached. The opposite record's origin gives the destination. This usage differs from a dangling <half-edge of a graph>.