An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision.

This article primarily delves into the automatic generation approach of the park road network. The design of the park road network not only comprehensively takes into account environmental factors like terrain, vegetation, water bodies, and buildings, but also encompasses functional factors such as road coverage and accessibility. It constitutes a relatively complex design task, and traditional design methods rely significantly on the professional proficiency of designers. Based on the park vector terrain, in combination with the graphics skeleton algorithm, this study proposes an automatic generation method of the park road network considering environmental constraints. Through the utilization of the modified Douglas–Peucker algorithm and convex hull operation, the semantic information of environmental constraints is retained, domain knowledge is integrated, the skeleton graph is optimized, and issues such as road smoothness are addressed. This method can not only generate road network schemes rapidly, scientifically, and precisely, but also furnish the requisite digital model for the quantitative evaluation of the road network. Eventually, the study quantitatively assesses the experimental results via the spatial syntax theory to substantiate the efficacy of the method.