Puzzle generators and symmetric puzzle layout

Conferences in Research and Practice in Information Technology Series

Volumn 45, Issue , 2005, Pages 97-105

  Sugiyama, Kozo ^a   Osawa, Ryo ^a   Hong, Seok Hee ^b  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b CSIRO   (Australia)

Author keywords

Puzzle generator; Symmetric layout

Indexed keywords

ABSTRACT MODELS; AESTHETIC CRITERIA; GRAPH DRAWING ALGORITHMS; LAYOUT ALGORITHMS; PUZZLE GENERATOR; SYMMETRIC LAYOUT;

ALGORITHMS; DRAWING (GRAPHICS); USER INTERFACES;

VISUALIZATION;

EID: 84883570053     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Aoki, S. (1997): A location problem with variables on boolean field, B. Eng. Thesis in Information Engineering, Toyohashi University of Technology.
2. Carr, H. and Kocay, W. (1999): An algorithm for drawing a graph symmetrically, Bulletin of the Institute of Combinatorics and its Applications, 27:19-25.
3. Eades, P. (1984): A heuristic for graph drawing, Congressus Numerantium, 42:149-160.
4. de Fraysseix, H. (1999): An heuristic for graph symmetry detection, Proc. of Graph Drawing 99, Lecture Notes in Computer Science 1731:276-285, Springer Verlag.
5. Hara, Y. and Kaya, Y. (1984): Automatic graph construction techniques for systems with strongly connected components, Proc. of Conf. of the Society of Instruments and Control Engineers, 20(6):506-513 (in Japanese).
6. Hong, S. and Eades, P. (2005): A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs, Proc. of Graph Drawing 2004, to appear.
7. Hong, S., McKay, B. and Eades, P. (2002): Symmetric drawings of triconnected planar graphs, Proc. of SODA 2002, 356-365.
8. Ichikawa, K. (1970): The science of creativity, Japan Broadcast Publishing Co., Ltd.
9. Joyner, D. (2002): Adventures in Group Theory: Rubik's Cube, Merlin's Machine, and Other Mathematical Toys, Johns Hopkins Univ. Press.
10. Lipton, R. North, S. and Sandberg, J. (1985): A method for drawing graphs, Proc. ACM Symp. on Computational Geometry, 153-160.
11. Maeda, A., Sugiyama, K. and Mase, K., (2002a): Media Conversion of permutation puzzles and development of permutation puzzles generators, IPSJ SIG Notes Human Interface, 101:33-40 (in Japanese).
12. Maeda, A., Sugiyama, K. and Mase, K. (2002b): Media conversion of cyclic puzzles and development of cyclic puzzle generators, IPSJ SIG Notes Human Interface, 101:40-47 (in Japanese).
13. Manning, J. and Atallah, M. J. (1992): Fast detection and display of symmetry in outerplanar graphs, Discrete Applied Mathematics, 39:13-35.
14. Otten, R. and van Wijk, J. G. (1978): Graph representations in interactive layout design, Proc. IEEE Int Symp. Circuits and Systems, New York, 914-918.
15. Osawa, R. (2004): Research and development on the layout problem of puzzle graph, Master Thesis, School of Knowledge Science, Japan Advanced Institute of Science and Technology.
16. Ozawa, T. (1980): Planarity testing for IC layout with constraints for pin order and congestion between pins, IEEE Conf. Record of the 14th Asilomar Conf. On Circuit, Systems and Computers, 188-192.
17. Sugiyama, K. (2002): Graph Drawing and Applications for Software and Knowledge Engineers, World Scientific.
18. Sugiyama, K., Hong, S. and Maeda, A. (2003): The puzzle layout problem, Proc. of Graph Drawing, Lecture Notes in Computer Science 2912:500-501, Springer Verlag.
19. Sugiyama, K., Maeda, A. and Mizumoto, A. (2003): 'Divergence via Abstraction': Practices for inventing new puzzles, Proc. of The 4th International Conference on Systems Science and Systems Engineering, 39-44.
20. Sugiyama, K., Maeda, A., Osawa, R., and Mizumoto A. (2005): Creating new puzzles : Practices of 'abstraction and conversion' strategy, Journal of the Japan Creativity Society (to appear).
21. Tuner, E. C. and Gold, K. F. (1982): Rubik's Groups, American Mathematical Monthly, 92(9).