Tag
The article explains a method for creating fractal boundaries in Voronoi partitions using a jittered grid approach, efficient for applications like coastline simulation.
This article presents a fast algorithm for computing the volume of a simple, closed, triangulated 3D mesh using the divergence theorem.
A blog post describes computing the Pole of Inaccessibility in the San Gabriel Mountains using a Voronoi diagram approach with OpenStreetMap road and trail data, and shares the resulting code in a GitHub repository.
Delaunay32 is a fast, parallel C++17 library for exact 2D Delaunay triangulation with integer predicates, supporting int32 coordinates and direct float input, and is significantly faster than existing triangulators.
Discusses a 2014 paper that refutes the 3SUM conjecture by presenting subquadratic algorithms for the 3SUM problem, with implications for computational geometry and graph algorithms.
A detailed thinking trace from the AI model Claude Fable as it designs a comprehensive computational geometry and physics simulation framework in Rust, incorporating advanced mathematical concepts like conformal geometric algebra and sheaf cohomology.
This paper from the 2008 Canadian Conference on Computational Geometry introduces the theory of balloon polyhedra, examining how balloon twisting can be modeled computationally to create geometric shapes.
Developer releases `exact-poly`, a 2D geometry library using exact integer arithmetic instead of floats to eliminate cross-platform reproducibility issues caused by IEEE 754 implementation differences.