An Algorithmic Approach to Decorative Content Placement
暂无分享,去创建一个
[1] Steven M. LaValle,et al. An Art Gallery Approach to Ensuring that Landmarks are Distinguishable , 2011, Robotics: Science and Systems.
[2] Subir Kumar Ghosh,et al. Visibility Algorithms in the Plane , 2007 .
[3] David Milam,et al. Design patterns to guide player movement in 3D games , 2010, Sandbox '10.
[4] Ian Horswill,et al. Fast Procedural Level Population with Playability Constraints , 2012, AIIDE.
[5] T. Asano. An Efficient Algorithm for Finding the Visibility Polygon for a Polygonal Region with Holes , 1985 .
[6] Jichen Zhu,et al. Guiding players through structural composition patterns in 3D adventure games , 2014, FDG.
[7] Hiroshi Imai,et al. Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams , 1990, SCG '90.
[8] Clark Verbrugge,et al. Clustering Player Paths , 2015, FDG.
[9] Max Jacobson,et al. A Pattern Language: Towns, Buildings, Construction , 1981 .
[10] Joseph O'Rourke,et al. Worst-case optimal algorithms for constructing visibility polygons with holes , 1986, SCG '86.
[11] Marina Daecher. 101 Things I Learned In Architecture School , 2016 .
[12] Sander Bakkes,et al. Generating Missions and Spaces for Adaptable Play Experiences , 2011, IEEE Transactions on Computational Intelligence and AI in Games.
[13] Clark Verbrugge,et al. An algorithmic approach to analyzing combat and stealth games , 2014, 2014 IEEE Conference on Computational Intelligence and Games.
[14] Zoran Popovic,et al. A case study of expressively constrainable level design automation tools for a puzzle game , 2012, FDG.