← All resources

Half-Edge Data Structure

Auto-discovered

Blog Intermediate

Various

Visit resource ↗

Description

The flipcode archives article from August 2000 explains the half-edge b-rep for triangle meshes. It targets programmers using vertex lists and face indices who need constant-time adjacency for edge collapse without full mesh scans.

It contrasts winged-edge storage with directed half-edge pairs in face loops and vertex rings, lists typical adjacency queries, and requires manifold topology where each edge borders two faces. C structs and loops demonstrate face- and vertex-centered traversal.

Intermediate programmers comfortable with C pointers and mesh terminology are the audience; the content is engine-agnostic mesh infrastructure.

Free static HTML with diagrams; remarks point to Harvard mesh-library code and radial-edge alternatives for non-manifold cases.

Still commonly linked as a readable half-edge introduction in geometry-processing notes and mesh tooling articles.