Halfedge Datastructure

The halfedge datastructure is based on halfedges that store incidence information to one vertex, one face, the opposite and the two incident halfedges. This datastructure is the underlying datastructure for Nef polygons, arrangements, as well as for polyhedral surfaces.

Functionality:dynamic
Robustness:industry strong
License:LGPL
Developed by:MPI