Name
Abstract | ||
|---|---|---|
Wave Function Collapse (WFC) is a non-backtracking, greedy search algorithm that is commonly known for its ability to take an example image and generate similar images. Since its inception, technical artists have explored the algorithm's extensibility and usability through various implementations spanning from 3D world generation to poetry creation. However, there has been no integration of design constraints into the generative process. In this paper, we explore WFC as a constraint satisfaction solver to integrate design principles and practices by modifying components within the algorithm. First, we extend the local constraint reasoning by incorporating non-local constraints as well as upper and lower bounds. Next, we further manipulate the generative space by introducing weight recalculation and dependencies. Lastly, we evaluate our design-focused variant of WFC against the original implementation to examine the associated costs in computational time and memory usage. In summary, this paper describes a technical implementation of integrating design constraints into WFC and analyzes the computational trade-offs.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3337722.3337752 | Proceedings of the 14th International Conference on the Foundations of Digital Games |
Keywords | Field | DocType |
level generation, procedural content generation, wave function collapse | Wave function collapse,Simulation,Computer science | Conference |
ISBN | Citations | PageRank |
978-1-4503-7217-6 | 1 | 0.36 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arunpreet Sandhu | 1 | 1 | 0.69 |
| Zeyuan Chen | 2 | 6 | 4.83 |
| Joshua McCoy | 3 | 23 | 5.36 |