C++ Library for Doubly Connected Edge List (DCEL)
-
Updated
Feb 6, 2022 - C++
#
doubly-connected-edge-list
Here are 6 public repositories matching this topic...
About Write a program to create a circular doubly linked list and perform insertions and deletions of various cases
c c-plus-plus cpp doublylinkedlist doubly-linked-list c-plus-plus-examples doubly-connected-edge-list c-plusplus cpplib cpplibrary doubly-circular-linked-list doublylinkedlist-operations
-
Updated
Aug 28, 2021 - C++
Doubly Connected Edge List (DCEL) is a Half-Edge Data Structure used to Represent Planar Graphs & Polyhedra in Computational Geometry
-
Updated
Oct 28, 2025 - Rust
Java implementation of a Half-Edge Data Structure. Derived from enjmiah, uses classes from nus-cs2030.
-
Updated
Jul 10, 2023 - Java
Build, edit and analyse edge-to-edge tessellations of unit-side polygons in Scala 3, on top of a Doubly Connected Edge List (DCEL).
svg scala tiling polygon computational-geometry tessellation scala-js half-edge dcel planar-subdivision doubly-connected-edge-list scala-3
-
Updated
Aug 14, 2026 - Scala
Golang implementation of doubly connected edge list (DCEL)
-
Updated
Jun 24, 2018 - Go
Add this topic to your repo
To associate your repository with the doubly-connected-edge-list topic, visit your repo's landing page and select "manage topics."