Sciweavers

Share
GD
2003
Springer

The Puzzle Layout Problem

9 years 5 months ago
The Puzzle Layout Problem
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled as puzzle graphs. Based on these models, we implement two puzzle generators and produce various layouts of the puzzles using graph drawing algorithms. Using these puzzle generators we can create new puzzles. Further by applying different layout algorithms, we can create new user interfaces of a puzzle with different attractions. Finally, we discuss a method for constructing symmetric layouts of puzzles, as symmetry is the most important aesthetic criteria for the puzzle layout.
Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where GD
Authors Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda
Comments (0)
books