Shortest-path tree-based method for calculating visible area with time- and memory-saving preprocessing
Bibliographic Data
| ID | 21247433 |
|---|---|
| Authors | Shota Tabata (0000-0003-2689-8819, Kajima Corporation (Japan), corresponding author) |
| Year | 2025 |
| Volume | 52 |
| Issue | 7 |
| Pages | 1618-1632 |
| Publication date | 2025-09-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Environment and Planning B Urban Analytics and City Science (JOURNAL) |
| Journal identifiers | ISSN: 2399-8083 • E-ISSN: 2399-8091 |
| Publisher | SAGE Publications (PUBLISHER • US) |
| DOI | 10.1177/23998083241302570 |
| OpenAlex | W4404650885 |
| Language | EN |
| References cited | 43 |
Visibility has extensive application in areas such as architecture, urban planning, and security. This study proposes a novel approximation method, called the shortest-path tree-based method (SPT-based method), for calculating the visible area using a random Delaunay network on a 2D plane. Various methods are available for calculating the visible area, including exact and approximation methods. However, it is difficult to calculate the visible area repeatedly in a space that has a vast number of obstacles while achieving efficient time and memory usage. The SPT-based method focuses on time- and memory-saving preprocessing. To achieve an efficient calculation of the visible area, we discretised a plane using a random Delaunay network and approximated the visible area using Dijkstra’s method. To evaluate the efficiency of the proposed method, we compared the calculation time, accuracy, and memory usage of the plane-sweep, ray-trace, brute-force, and SPT-based methods while considering the influence of the number of obstacles. This study provides valuable insights for researchers and practitioners for choosing the most suitable approach for their specific needs. Overall, the proposed method offers a time- and memory-efficient solution for calculating the visible area, making it suitable for a detailed analysis of the visual environment and providing a heuristic solution to the art gallery problem requiring repetitive calculations
Algorithm · Combinatorics · Data pre-processing · Graph · Preprocessor · Shortest path problem · Computer Science · Data Visualization and Analytics · Mathematics · Urban Design and Spatial Analysis · Video Surveillance and Tracking Methods · Artificial Intelligence · Theoretical Computer Science
A note on two problems in connexion with graphs
To Take Hold of Space
From Isovists to Visibility Graphs
Exploring Isovist Fields
Towards Managing Visual Pollution
Using Isovists in Measuring Surveillance and Expected Guardianship in Residential Neighborhood Property Crimes
From viewsheds to viewscapes
Isovist indicators as a means to relieve pedestrian psycho-physiological stress in Hong Kong
New algorithms for generating isovist field and isovist measurements
Embodied 3D isovists
The association between perceived density in minimum apartments and spatial openness index three-dimensional visual analysis
Integrating ‘weighted views’ to quantitative 3D visibility analysis as a predictive tool for perception of space
| Citation velocity | historical |
|---|---|
| Highly cited | No |