Demos

Explore how distance multisets distinguish edges in subdivided complete graphs. Compare observers, trace distances and inspect constructions and finite certificates.

Explore pattern-avoiding permutations, build their polytopes, count lattice points, repair polynomials and follow an exact verifier.

Follow sequential Euclidean connections with exponential memory through six questions about cost, arrivals, long-run behavior and adversarial choices.

Pair ordered vertices, allow crossings, and avoid nesting. Follow a guided investigation of minimum blockers and explore graphs with unused vertices.

Compare six ways to find a triangle, from visibility walks to remembered queries and Delaunay hierarchies.

Move vertices and inspect the regions that preserve a Delaunay triangulation. Explore centroidal Voronoi tessellations with Lloyd iterations, together or one by one.

Explore how intersections of paraboloids shape a reflector and redistribute light, with reflected rays and a power diagram on the sphere.

Draw a planar subdivision with direction constraints and explore whether T can be reached from S. Compare the article trace with three examples of geometric exclusion.