Projects‎ > ‎

BVN

Abstract

The concept of integration can be used for analysing the spatial layout of buildings. It is a measure of the accessibility of a location, or how easily one can travel from one location to all other locations. A visibility graph is first created from the spatial layout, and the closeness centrality of each vertex is calculated. However, this operation is very slow, with a time complexity of O(n^2logn) by running Dijkstra's algorithm on each vertex of the graph. We explore methods to perform this computation faster through parallel computation and approximation methods.

People

  • Derek Chan
  • Ben Doherty
  • Masahiro Takatsuka

Aim


Background


Idea


Progress

Repository

We strongly suggest you to use git rather than subversion.  If you don't have a repository for this newly created project, please contact ViSLAB admin to create one.

git clone ssh://project.vislab.usyd.edu.au/Groups/groupname/projectname.git
or

svn co svn+ssh://project.vislab.usyd.edu.au/Groups/groupname/projectname

Resources

You should create a "Resources" page as a "File Cabinet" and put the link to "Resources" title.  You should release various files such as released vernon binary in this page.

Links

  • links to related sites go here


You should Insert "Recent Posts" pointing to your Progress here.