An Algorithm for Creating Geometric Dissection Puzzles

Year: 2012 Authors: Yahan Zhou; Rui Wang

Core claim

A hierarchical clustering optimization can efficiently produce near-optimal geometric dissections on discrete lattices and extend to 3D dissections.

Topics

geometric dissection, optimization, lattice grids, 3D puzzle construction

Domains

computational geometry, discrete geometry, polygon dissections, graph clustering, recreational mathematics, pattern design, visual puzzle design, architectural ornament

Methods

hierarchical clustering, objective function minimization, rasterization, random exploration

Media

square lattice, triangular lattice, rasterized figures, 3D shapes

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.