Abstract
Snappable Meshes is an algorithm that procedurally generates 3D environments by iteratively selecting and linking pre-built map pieces. These pieces are triangular meshes annotated by designers with connectors marking potential links, and bounding volumes indicating where overlaps should be avoided. In this article, we present a method for automatically generating connectors and bounding volumes from generic non-manifold triangular meshes for use with the Snappable Meshes algorithm, minimizing artist/designer work, while encouraging iteration of map piece design, an essential part of successful environment generation.
Original language | English |
---|---|
Title of host publication | Proceedings of the 18th International Conference on the Foundations of Digital Games, FDG 2023 |
DOIs | |
Publication status | Published - 12 Apr 2023 |
Event | ACM - Duration: 12 Apr 2023 → … |
Conference
Conference | ACM |
---|---|
Period | 12/04/23 → … |
Keywords
- PROCEDURAL CONTENT GENERATION
- COMPUTER GAMES
- COMPUTATIONAL GEOMETRY
- COMPUTER SCIENCE