The effect of A* pathfinding characteristics on the path length and performance in an octree representation of an indoor point cloud

This thesis presents a new workflow for path finding through an octree representation of an indoor point cloud. I applied the following steps: 1) the point cloud is processed so it fits best in an octree; 2) during the octree generation the interior empty nodes are identified and further processed; 3) for each interior empty node the distance to...

Configurbanist: Easiest paths, fuzzy accessibility, and network centrality for walking and cycling in cities

In a quest for promoting sustainable modes of mobility, we have revisited how feasible and suitable is it for people to walk or cycle to their destinations in a neighbourhood. We propose a few accessibility measures based on an 'Easiest Path' algorithm that provides also actual temporal distance between locations. This algorithm finds paths that...

"Improved geometric network model" (IGNM): A novel approach for deriving connectivity graphs for indoor navigation

Over the past few years Personal Navigation Systems have become an established tool for route planning, but they are mainly designed for outdoor environments. Indoor navigation is still a challenging research area for several reasons: positioning is not very accurate, users can freely move between the interior boundaries of buildings, path...

Configurbanist: Urban Configuration Analysis for Walking and Cycling via Easiest Paths

In a quest for promoting sustainable modes of mobility, we have revisited how feasible and suitable is it for people to walk or cycle to their destinations in a neighbourhood. We propose a few accessibility measures based on an 'Easiest Path' algorithm that provides also actual temporal distance between locations. This algorithm finds paths that...