Parameterized IFC-based graph generation for user-oriented path search

This paper deals with the problem of transforming the data obtained from the IFC file of a given building into a weighted graph, which is used for searching shortest routes accessible for different types of users including people and mobile objects. This graph contains information about the topology and accessibility between building spaces. It is created using the parameter specifying the permissible distance from the center of a moving object to a wall. Edge weights are calculated based on the Euclidean distance between nodes representing doors or internal points of rooms with concave shapes. On the basis of information encoded in the graph the application calculates the shortest path between designated rooms and creates its visualization. The presented approach is illustrated on examples of searching shortest routs between spaces of the building extracted from the IFC file belonging to the free IFC model database.