C++ implementation of Fortune algorithm for Voronoi diagram construction
A DCEL (doubly connected edge list) implementation using C++ 11
A Java libray for creating and editing half-edge data structure
C++ Library for Doubly Connected Edge List (DCEL)
Provides implementations of Polygon Triangulation, DCEL and Convex Hull Generation
Doubly-Connected-Edge-List (DCEL) implementation for three.js
A Computational Geomemtry Class Project that implements DCEL data struture and Polygon triangulation as well as Plannar point location using persistent search trees.
Golang implementation of doubly connected edge list (DCEL)
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.
Algorithm and data structures assignment one. DCEL implementation in c.
Our entry to the cg-shop-25 competition, solving the non-obtuse triangulation problem.
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."