A Linear Programming Method for Finding a Minimal Set of Axial Lines Representing an Entire Geometry of Building and Urban Layout

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 52
  • Download : 18
This paper devises an algorithm for finding the minimal set of axial lines that can represent a geometry of building and urban layout in two dimensions. Although axial lines are useful to analyze spatial configuration in the Space Syntax, existing methods for selecting axial lines seldom address the optimality of their solutions. The proposed algorithm uses linear programming to obtain a minimal set of axial lines. To minimize the number of axial lines that represent the entire geometry of building and urban layout, a linear programming problem is established in which a set of axial lines represents the entire geometry. The axial lines must have at least one intersection with every extension line of the wall edges to the sides of the reflex angles. If a solution to this linear programming problem exists, it will be guaranteed to be an optimum. However, some solutions of this general linear programming problem may include isolated lines, which are undesirable for an axial line analysis. To avoid isolated axial lines, this paper states a new formulation by adding a group of constraints to the original formulation. By examining the modified linear programming problem in various two-dimensional building maps and spatial layouts, this paper demonstrates that the proposed algorithm can guarantee a minimum set of axial lines to represent a two-dimensional geometry. This modified linear programming problem prevents isolated axial lines in the process of axial line reduction.
Issue Date
Article Type

APPLIED SCIENCES, v.10, no.12, pp.4273

Appears in Collection
CE-Journal Papers(저널논문)
Files in This Item
Jung-Kim-2020.pdf(840.45 kB)Download


  • mendeley


rss_1.0 rss_2.0 atom_1.0