Constraint Theory

A computational framework for constraint-based geometry — expressing spatial relationships through Pythagorean triples, KD-trees, and multi-agent coordination. Explore the interactive demos below.

Pythagorean Snapping

Core demo: visualize how geometric constraints snap to Pythagorean-triple lattice points in real time.

KD-Tree Spatial Queries

Explore nearest-neighbor and range queries over dynamic point sets using an interactive KD-tree.

Swarm Coordination

Watch autonomous agents self-organize under constraint fields, balancing cohesion, separation, and alignment.