Data Structures and Algorithms

   

Monte Carlo based Algorithm for Scoring Grid Systems

Authors: Syed Haseeb Shah

We evaluate Monte Carlo based algorithm for scoring grid systems. The former were used to describe features of the area under study. This was done to select suitable features for City Information Modelling. These algorithms measures path of shortest distance. However, shortest distance does not always ensures shortest time. The algorithm works by pairing multiple iterations of two random numbers in a polygon. The mean of shortest path between these points is calculated. Thus grid systems with shorter paths will return a lower value as compared to grid systems with longer paths. This was applied to GIS systems in urban planning to rate the feasibility of different grid systems. It is a heuristic algorithm that tells us to about the nature of grid system. Instead of measuring the geometry of every path in a grid it eases the workflow of an urban planner by automation.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2019-11-08 09:33:49

Unique-IP document downloads: 4 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