Doubly Connected Edge List (DCEL)

Doubly Connected Edge List (DCEL) is a Half-Edge Data Structure used to Represent Planar Graphs & Polyhedra in Computational Geometry

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
src		src
.gitignore		.gitignore
Cargo.lock		Cargo.lock
Cargo.toml		Cargo.toml
README.md		README.md

Provide feedback