C++ implementation of Fortune algorithm for Voronoi diagram construction
A DCEL (doubly connected edge list) implementation using C++ 11
C++ Library for Doubly Connected Edge List (DCEL)
A Java libray for creating and editing half-edge data structure
Doubly-Connected-Edge-List (DCEL) implementation for three.js
Construct geometric tilings and turn them into origami tessellations
Provides implementations of Polygon Triangulation, DCEL and Convex Hull Generation
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.
Our entry to the cg-shop-25 competition, solving the non-obtuse triangulation problem.
A Computational Geomemtry Class Project that implements DCEL data struture and Polygon triangulation as well as Plannar point location using persistent search trees.
Doubly connected edge list (DCEL, half-edge data structure) in Rust.
Build, edit and analyse edge-to-edge tessellations of unit-side polygons in Scala 3, on top of a Doubly Connected Edge List (DCEL).
Golang implementation of doubly connected edge list (DCEL)
Algorithm and data structures assignment one. DCEL implementation in c.
基于 DCEL 半边结构的平面细分：从任意二维曲线集合提取最小面域与最大面域。拓扑核心零 CAD 依赖，Revit 仅为适配器。配 58 个不变量测试。
Computational geometry project on map overlays with DCEL data structures
To associate your repository with the dcel topic, visit your repo's landing page and select "manage topics."