An implementation of a half-edge data structure (DCEL) in purely safe Rust, using ghost-cell and typed arena allocation to deal with the cyclic nature of the data structure. The goal is to provide a safe (primary priority) and performant (secondary priority) library for mesh processing in Rust.
Doubly-Connected-Edge-List (DCEL) implementation for three.js
C++ Library for Doubly Connected Edge List (DCEL)
Algorithm and data structures assignment one. DCEL implementation in c.
Provides implementations of Polygon Triangulation, DCEL and Convex Hull Generation
C++ implementation of Fortune algorithm for Voronoi diagram construction
A Java libray for creating and editing half-edge data structure
Golang implementation of doubly connected edge list (DCEL)
A DCEL (doubly connected edge list) implementation using C++ 11
A Computational Geomemtry Class Project that implements DCEL data struture and Polygon triangulation as well as Plannar point location using persistent search trees.
Add a description, image, and links to the dcel topic page so that developers can more easily learn about it.
To associate your repository with the dcel topic, visit your repo's landing page and select "manage topics."