Algorithms for random maps generation and their implementation as a python library

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Random map generation has application in strategy computer games, terrain simulators, and other areas. In this paper basic assumptions of a library for random maps generation are presented. It uses both value noise and diamond square computer graphics algorithms, as well as newly invented algorithms for biomes creation and river generation. Complete library implementation with an example use in a separate application is explained in detail. Basic issues related to developing programming libraries and random map generations are also discussed.

Cite

CITATION STYLE

APA

Rusek, M., Jusiak, R., & Karwowski, W. (2018). Algorithms for random maps generation and their implementation as a python library. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11114 LNCS, pp. 57–67). Springer Verlag. https://doi.org/10.1007/978-3-030-00692-1_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free