Data Structures and Algorithms

    

Efficient Field of Vision Algorithms for Large 2D Grids

Authors: Evan R.M. Debenham, Roberto Solis-Oba

This paper presents new algorithms for Field of Vision (FOV) computation which improve on existing work at high resolutions. FOV refers to the set of locations that are visible from a specific position in a scene of a computer game. We review existing algorithms for FOV computation, describe their limitations, and present new algorithms which aim to address these limitations. We first present an algorithm which makes use of spatial data structures in a way which is new for FOV calculation. We then present a novel technique which updates a previously calculated FOV, rather than re-calculating an FOV from scratch. We compare our algorithms to existing FOV algorithms and show they provide substantial improvements to running time. Our algorithms provide the largest improvement over existing FOV algorithms at high resolutions, thus allowing the possibility of the creation of high resolution FOV-based video games.

Comments: 20 Pages. Published in IJCSIT, 13(1), 2021 [Corrections are made by viXra Admin to comply with the rules of viXra.org]

Download: PDF

Submission history

[v1] 2021-03-07 20:27:29

Unique-IP document downloads: 428 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus