1613| 5
|
[插件资源] Dungeon Architect v1.6.0(无需翻墙) |
|
Dungeon Architect is a procedural level generation tool. It lets you said author your own dungeons both at runtime and design-time with powerful editor tooling. Procedural Demo | Tech Demo Use an intuitive graph based theming approach to interactively design the look and feel of your dungeons and control the layout using various editor based tooling Runtime navigation mesh generation is also supported, which is necessary for your procedural dungeons Features: - Procedural Levels: Generate vast procedural levels with a single click - Runtime Dungeons: Generate dynamic dungeons at runtime - Theming: Use an initive graph based on theiring approach to interactively design the look and feel of your dungeons - NavMesh: Generates dynamic navigation mesh . Also comes with a navigation agent implementation for moving AI bots along the nav mesh - Paint Tool: Paint your own dungeon layout within the editor for more artistic control, and have the environment automatically build around it - Volumes: Use various types of volumes to influence the dungeon layout - Terrain Modifier: Procedurally modifies and paints the terrain along the dungeon layout - 2D Support: Use the same workflow to create 2D levels. The theming engine supports sprites for your 2D games - Scriptable: Add your own logic on any of the the theme graph node to control the way The Props are populated in the scene. - Source Code: Full Source Code access and documentation - Extensible: Designed to be modular and extensible (eg the dungeon generation algorithm can be easily swapped with another algorithm and work seamlessly with the rest of the pipeline) - Sample Content: Free sample assets are included to help you quickly get started. A sample game helps demo the various features of Dungeon Architect (Runtime procedural dungeons, Dynamic Navigation Mesh, AI Agents using the nav mesh etc)
购买主题
已有 2 人购买
本主题需向作者支付 10 纳金币 才能浏览
|
相关帖子
|
|
|
| |
|
| |
手机版|纳金网 ( 闽ICP备2021016425号-2/3 )
GMT+8, 2024-11-24 03:46 , Processed in 0.088031 second(s), 33 queries .