A Method for the Optimized Placement of Bus Stops Based on Voronoi Diagrams

Individualizing Civic Responsibility

10.1093/oso/9780190691332.003.0003 ◽

2018 ◽

Author(s):

Gordon C.C. Douglas

Keyword(s):

Cultural Values ◽

Service Provision ◽

Urban Policy ◽

Civic Responsibility ◽

Local Service ◽

Market Driven ◽

Bus Stops ◽

Street Furniture ◽

Policy And Planning

Chapter 3 demonstrates that DIY urban designers are largely motivated by failings they perceive in urban policy and planning. Placing them in this context is essential for interpreting the phenomenon. While do-it-yourselfers respond to the problems they see in creative ways, their individualistic tactics of doing so introduce problems of their own. The chapter focuses on bus stops to consider the lack of sidewalk seating in many cities, the privatization of street furniture, and concerns with local service provision. In trying to correct problems they see, do-it-yourselfers always impart their own personal and cultural values, and some DIY alterations can be selfish and anti-social in impact. The chapter interrogates DIY urbanism in the context of the “neoliberalized” city, arguing that even as the practices aim to counter the ill effects of market-driven planning, they can also reinforce an individualistic, undemocratic logic in placemaking.

Download Full-text

Electronic Solution to Address Traffic Issues Near Bus Stops

2021 International Conference on Artificial Intelligence and Smart Systems (ICAIS) ◽

10.1109/icais50930.2021.9395826 ◽

2021 ◽

Author(s):

Utkarsh Mishra ◽

Rain Ritika ◽

Rajeshwar ◽

Ashish Kumar Mishra ◽

P B Karandikar

Keyword(s):

Bus Stops

Download Full-text

Accessibility for Persons with Mobility Impairment at Bus Stops

IOP Conference Series Earth and Environmental Science ◽

10.1088/1755-1315/673/1/012049 ◽

2021 ◽

Vol 673 (1) ◽

pp. 012049

Author(s):

Z M Utari ◽

N R Kusuma

Keyword(s):

Mobility Impairment ◽

Bus Stops

Download Full-text

Polygon visibility ordering via Voronoi diagrams

The Visual Computer ◽

10.1007/s00371-007-0121-z ◽

2007 ◽

Vol 23 (7) ◽

pp. 503-511 ◽

Cited By ~ 1

Author(s):

Shinichi Fukushige ◽

Hiromasa Suzuki

Keyword(s):

Voronoi Diagrams ◽

Visibility Ordering

Download Full-text

Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons

Algorithmica ◽

10.1007/s00453-021-00824-9 ◽

2021 ◽

Author(s):

Gill Barequet ◽

Minati De ◽

Michael T. Goodrich

Keyword(s):

Voronoi Diagrams ◽

Convex Polygons

Download Full-text

Influence-based Voronoi diagrams of clusters

Computational Geometry ◽

10.1016/j.comgeo.2021.101746 ◽

2021 ◽

Vol 96 ◽

pp. 101746

Author(s):

Ziyun Huang ◽

Danny Z. Chen ◽

Jinhui Xu

Keyword(s):

Voronoi Diagrams

Download Full-text

Sharing bus stops: An efficient use of public spaces

Journal of Cleaner Production ◽

10.1016/j.jclepro.2021.126282 ◽

2021 ◽

Vol 294 ◽

pp. 126282

Author(s):

Sara Ezquerro ◽

Borja Alonso ◽

José Luis Moura

Keyword(s):

Public Spaces ◽

Bus Stops

Download Full-text

Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees

Mathematical Problems in Engineering ◽

10.1155/2014/456739 ◽

2014 ◽

Vol 2014 ◽

pp. 1-14 ◽

Cited By ~ 1

Author(s):

Quanjun Yin ◽

Long Qin ◽

Xiaocheng Liu ◽

Yabing Zha

Keyword(s):

Voronoi Diagrams ◽

Surrounding Area ◽

Repair Mechanism ◽

Local Repair ◽

Order Of Magnitude ◽

Generalized Voronoi Diagrams ◽

Incremental Construction ◽

Coarse To Fine ◽

Multiple Granularities ◽

Magnitude Improvement

In robotics, Generalized Voronoi Diagrams (GVDs) are widely used by mobile robots to represent the spatial topologies of their surrounding area. In this paper we consider the problem of constructing GVDs on discrete environments. Several algorithms that solve this problem exist in the literature, notably the Brushfire algorithm and its improved versions which possess local repair mechanism. However, when the area to be processed is very large or is of high resolution, the size of the metric matrices used by these algorithms to compute GVDs can be prohibitive. To address this issue, we propose an improvement on the current algorithms, using pointerless quadtrees in place of metric matrices to compute and maintain GVDs. Beyond the construction and reconstruction of a GVD, our algorithm further provides a method to approximate roadmaps in multiple granularities from the quadtree based GVD. Simulation tests in representative scenarios demonstrate that, compared with the current algorithms, our algorithm generally makes an order of magnitude improvement regarding memory cost when the area is larger than210×210. We also demonstrate the usefulness of the approximated roadmaps for coarse-to-fine pathfinding tasks.

Download Full-text