The Connect-The-Dots family of puzzles
暂无分享,去创建一个
[1] Leonidas J. Guibas,et al. Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, ISA.
[2] Sancho Salcedo-Sanz,et al. Automated generation and visualization of picture-logic puzzles , 2007, Comput. Graph..
[3] Robert E. Tarjan,et al. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..
[4] Frédéric Maire,et al. Evolutionary Game Design , 2011, IEEE Transactions on Computational Intelligence and AI in Games.
[5] David Eppstein,et al. The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..
[6] M. V. Kreveld,et al. Topologically correct subdivision simplification using the bandwidth criterion , 1998 .
[7] M. Iri,et al. Polygonal Approximations of a Curve — Formulations and Algorithms , 1988 .
[8] David Eppstein,et al. On Nearest-Neighbor Graphs , 1992, ICALP.
[9] G.S. Brodal,et al. Dynamic planar convex hull , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[10] Craig S. Kaplan,et al. Image-guided maze construction , 2007, SIGGRAPH 2007.
[11] John Hart,et al. ACM Transactions on Graphics , 2004, SIGGRAPH 2004.
[12] S. Colton. Automated Puzzle Generation , 2002 .
[13] Hyun Joon Shin,et al. SPOID: a system to produce spot-the-difference puzzle images with difficulty , 2013, The Visual Computer.
[14] Alexandru Iosup,et al. Procedural content generation for games: A survey , 2013, TOMCCAP.
[15] Michael Burch,et al. Evaluating Partially Drawn Links for Directed Graph Edges , 2011, GD.
[16] W. S. Chan,et al. Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error , 1996, Int. J. Comput. Geom. Appl..
[17] Joe Marks,et al. An empirical study of algorithms for point-feature label placement , 1995, TOGS.
[18] J. O'Rourke,et al. Connect-the-dots: a new heuristic , 1987 .
[19] Joseph S. B. Mitchell,et al. Simplifying a polygonal subdivision while keeping it simple , 2001, SCG '01.
[20] Jong-Chul Yoon,et al. A Hidden‐picture Puzzles Generator , 2008, Comput. Graph. Forum.
[21] Kurt Mehlhorn,et al. Curve reconstruction: connecting dots with good reason , 1999, SCG '99.
[22] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .
[23] Tony DeRose,et al. Surface reconstruction from unorganized points , 1992, SIGGRAPH.