Game level layout from design specification

The design of video game environments, or levels, aims to control gameplay by steering the player through a sequence of designer‐controlled steps, while simultaneously providing a visually engaging experience. Traditionally these levels are painstakingly designed by hand, often from pre‐existing bui...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computer graphics forum Ročník 33; číslo 2; s. 95 - 104
Hlavní autori:	Ma, Chongyang, Vining, Nicholas, Lefebvre, Sylvain, Sheffer, Alla
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Blackwell Publishing Ltd 01.05.2014 Wiley
Predmet:	Algorithms Analysis and object representations Assembling Categories and Subject Descriptors (according to ACM CCS) Computer & video games Computer graphics Computer Science Connectivity Convergence Design specifications Games Graph theory Graphics Graphs I.3.5 [Computer Graphics] Computational Geometry and Object Modeling-Curve I.3.5 [Computer Graphics] Computational Geometry and Object Modeling—Curve, surface, solid, and object representations Layouts Software engineering solid Specifications Strategy Studies surface Tasks
ISSN:	0167-7055, 1467-8659
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	The design of video game environments, or levels, aims to control gameplay by steering the player through a sequence of designer‐controlled steps, while simultaneously providing a visually engaging experience. Traditionally these levels are painstakingly designed by hand, often from pre‐existing building blocks, or space templates. In this paper, we propose an algorithmic approach for automatically laying out game levels from user‐specified blocks. Our method allows designers to retain control of the gameplay flow via user‐specified level connectivity graphs, while relieving them from the tedious task of manually assembling the building blocks into a valid, plausible layout. Our method produces sequences of diverse layouts for the same input connectivity, allowing for repeated replay of a given level within a visually different, new environment. We support complex graph connectivities and various building block shapes, and are able to compute complex layouts in seconds. The two key components of our algorithm are the use of configuration spaces defining feasible relative positions of building blocks within a layout and a graph‐decomposition based layout strategy that leverages graph connectivity to speed up convergence and avoid local minima. Together these two tools quickly steer the solution toward feasible layouts. We demonstrate our method on a variety of real‐life inputs, and generate appealing layouts conforming to user specifications.
Bibliografia:	ArticleID:CGF12314 istex:C0E3A0DE316DC30F3809A78FDF619664C34BC58E ark:/67375/WNG-8JQSWZ9H-N SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
ISSN:	0167-7055 1467-8659
DOI:	10.1111/cgf.12314