Spherical Maze Generation
نویسندگان
چکیده
In this paper, we proposed an automatic spherical maze generation framework. Traditional mazes are generated on two or three dimensional spaces, with regular grids as walls and paths. Instead of pure two or three dimensional mazes, we automatically generate maze on the surface of a sphere, which provides a unique and fresh maze solving experience. Because regular grids on spherical surface will result in nonuniform room spaces, we randomly generate uniformly distributed points on the sphere. Then we automatically create the wall mesh structures by triangulation and Voronoi graph generation. Gift-wrapping algorithm and incremental construction are both conducted for the spherical triangulation. To create the spherical maze, union-find algorithm is applied to remove parts of the walls, build the paths and join all the rooms.
منابع مشابه
Effect of prenatal immobilization stress on spatial memory, anxiety-like behavior and brain BDNF concentration in the F1 generation male mice
Background and Aim: In this study, we investigated the effect of immobilization stress during pregnancy on the spatial memory, anxiety-like behavior and brain BDNF level in F1 generation male NMRI mice. Materials and Methods: Twenty female pregnant mice were randomly divided into stress and control groups. The stress group received stress using a restraint cylinder (6 cm ID, 20 cm L) 60 min/da...
متن کاملSpatial learning by mice in three dimensions
We tested whether mice can represent locations distributed throughout three-dimensional space, by developing a novel three-dimensional radial arm maze. The three-dimensional radial maze, or "radiolarian" maze, consists of a central spherical core from which arms project in all directions. Mice learn to retrieve food from the ends of the arms without omitting any arms or re-visiting depleted one...
متن کاملEvent-Centered Maze Generation Method for Mobile Virtual Reality Applications
This study proposes a method of effectively creating mobile virtual reality scenes centered at events for the purpose of providing new experiences in virtual reality environment to users. For this purpose, this paper uses Prim’s maze generation algorithm to automatically create maze environments that have different patterns every time and to compute mazes with finite paths. This paper designs a...
متن کاملThe Maze Generation Problem is NP-complete
The Maze Generation problem has been presented as a benchmark for the Second Answer Set Programming Competition. We prove that the problem is NP–complete and identify relevant classes of unsatisfiable instances. The Maze Generation (MG) problem has been presented as a benchmark for the Second Answer Set Programming (ASP) Competition1. The problem has been placed in the NP category, which contai...
متن کاملHow to make a picturesque maze
In the picturesque maze generation problem, we are given a rectangular black-and-white raster image and want to randomly generate a maze in which the solution path fills up the black pixels. While a simple formulation of the problem faces with NP-hardness, the proposed method generates such a maze in polynomial time by appropriately changing the formulation itself. Therefore, the algorithm itse...
متن کامل