⟨Grassmann-Clifford-Hodge⟩ multilinear differential geometric algebra
Computational geometry in Julia
Scalable symbolic-numeric set computations in Julia
DelaunayTriangulation.jl: A Julia package for Delaunay triangulations and Voronoi tessellations in the plane
Julia package for manipulation and analysis of planar geometric objects
A Julia port of Turf.js http://turfjs.org/
TensorField topology over FrameBundle ∇ with Grassmann.jl finite elements
Julia package for manipulating braids, including reductions and representations
Geometry for fluid dynamics
Solving Fermat–Torricelli problem in Julia.
Presentation and reimplementation for Algorithm Design Seminar 1 on plurality points
Solving smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing circle problem) in Julia.
Add a description, image, and links to the computational-geometry topic page so that developers can more easily learn about it.
To associate your repository with the computational-geometry topic, visit your repo's landing page and select "manage topics."