2D Arrangement-based Hierarchical Spatial Partitioning: An Application to Pedestrian Network Generation

摘要: This paper addresses the creation and maintenance of partitions city surfaces for mapping transportation applications. It proposes a hierarchical spatial surface partitioning, encoding partition with 2D arrangement structuring generic hierarchy semantic objects directed acyclic graph (DAG), in which leaves point to elements (polygonal regions, line strings, points). Semantic such as buildings, sidewalks roads are described by grouping other their relationships. In proposed data model, geometry relationships respectively topology planar partition. The geometric structure creating maintaining this is arrangement. addition, object model encodes thematic between objects. Besides methods algorithms discussed leveraging existing vector datasets create maintain partitions. These then fit further processing analysis using computational theory algorithms. For purpose, three application-wise were integrated into our system called Streetmaker: two skeleton operators centerline generation (straight medial axis) connectivity graphs itinerary calculations. Moreover, specific can be Streetmaker We demonstrated an example usage framework generating static obstacle avoiding pedestrian network graphs. representation process used generate it, considered second contribution work besides model.