Area Collapse and Road Centerlines based on Straight Skeletons

@article{Haunert2008AreaCA,
  title={Area Collapse and Road Centerlines based on Straight Skeletons},
  author={Jan-Henrik Haunert and Monika Sester},
  journal={GeoInformatica},
  year={2008},
  volume={12},
  pages={169-191}
}
Skeletonization of polygons is a technique, which is often applied to problems of cartography and geographic information science. Especially it is needed for generalization tasks such as the collapse of small or narrow areas, which are negligible for a certain scale. Different skeleton operators can be used for such tasks. One of them is the straight skeleton, which was rediscovered by computer scientists several years ago after decades of neglect. Its full range of practicability and its… 
Area collapse algorithm computing new curve of 2D geometric objects
TLDR
A new algorithm for the automatic calculation of polygonal chains representing a 2D polygon, and it has a linear plot without branches, which is entirely contained within the area of the input polygon and the computational process is automatic and repeatable.
Derivation of road network from land parcels
TLDR
The proposed algorithm keeps the time complexity of straight skeleton algorithm, however, it partitions the target region into subregions where the skeletons have been computed in individual subregion instead of the whole region, and crossing patterns have been found and utilized to prune the results, hence it is not only much faster in practical computation, but also it is more suited to human perceptions.
A progressive method for the collapse of river representation considering geographical characteristics
TLDR
The presented method can progressively collapse the river during scale transformation to support the LOD representation in a highly sensitive way and can generate smooth single-line rivers from dual- line rivers considering different river widths while effectively avoiding burrs and fractured intersections.
Recognition of group patterns in geological maps by building similarity networks
Abstract The recognition of structures is fundamental to map generalization, furnishing structural information that assists in choosing and parameterizing generalization operators. We specifically
Partial polygon pruning of hydrographic features in automated generalization
TLDR
An algorithm for automatic detection and subsequent processing of waterbody polygons is described and results for a sample of NHD subbasins in different landscape conditions in the US are shown.
Triangulation Method for Area-line Geometry-type Changes in Map Generalisation
Abstract Changes in object geometry-type such as area to line are necessary in terms of the requirements of cartographic generalisation, and also for the creation of the network topology in
SKELETON-BASED AUTOMATIC ROAD NETWORK EXTRACTION FROM AN ORTHOPHOTO COLORED POINT CLOUD
Reliable and up-to-date road network information is crucial to guarantee efficient logistic distribution, emergency response, urban planning, etc. Road networks in developing urban areas tend to
SPLITAREA: an algorithm for weighted splitting of faces in the context of a planar partition
TLDR
The quality of the split operation is formally assessed by comparing the results on actual test data sets with a goal/metric defined beforehand for the ‘balanced’ split and the algorithm allows a weighted split, where different neighbours have different weights due to different compatibility.
An Algorithm to Generate a Simplified Railway Network through Generalization
don Tube. Since this type of map lacks a lot of additional cartographic information, it has become also common to show the geometry of the route as an overlay on a real map, so that the user is able
Skeleton Line Extraction Method in Areas with Dense Junctions Considering Stroke Features
TLDR
Experimental results show that the proposed method can better identify the areas with dense junctions and that the extracted skeleton line is naturally smooth and well-connected, which accurately reflects the main structure and extension characteristics of these areas.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Street Centreline Generation with an Approximated Area Voronoi Diagram
TLDR
This paper presents a methodology to generate a topologically correct street centreline from city block boundaries using ArcGIS software and suggests for further enhancements that have, among other things, the potential to automate attribution to network segments using adjacent polygon attributes.
Straight Skeleton Implementation
Straight s k eleton Angular Bisector Network, ABN of a planar polygon, which can be grasped as a modiication of a planar Voronoi diagram without parabolic arcs, has been successfully used by O l i v
Generation Of 3D City Models From Airborne Laser Scanning Data
TLDR
The segmentation of planar surfaces from the DSM, which is a prerequisite for the 3D reconstruction of the buildings, is supported by given ground plans, and the very high demands on the spatial resolution and quality of the DSM can additionally be reduced.
GAP-Tree Extensions Based on Skeletons
The Generalized Area Partitioning tree (GAP-tree) is a model that supports on-the-fly generalisation of planar partitions of polygon objects. This paper focuses on solving some limitations of the
Morphological Models for the Collapse of Area Features in Digital Map Generalization
TLDR
A set of algebraic models built upon the operators in mathematical morphology is described for the area-to-line collapse and partial collapse operations.
A Novel Type of Skeleton for Polygons
A new internal structure for simple polygons, the straight skeleton, is introduced and discussed. It is composed of pieces of angular bisectores which partition the interior of a given n-gon P in a
A Straight Skeleton Approximating the Medial Axis
TLDR
The notion of e-Equivalence between two skeletons is introduced, and an algorithm that computes the number of zero-length edges for each reflex vertex which yield a linear axis e-equivalent to the medial axis is given.
Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions
TLDR
The straight skeleton of an n -gon with r reflex vertices is constructed in time O(n 1+e + n 8/11+e r 9/11-e ) , for any fixed e >0, improving the previous best upper bound of O(nr log n) .
Construction of the planar partition postal code map based on cadastral reGIStration
TLDR
The procedure, based on the Dutch cadastral reGIStration, to obtain a reliable 6-position planar postal code map for the Netherlands is described and some results are shown by figures.
Finding the Medial Axis of a Simple Polygon in Linear Time
TLDR
A linear-time algorithm for computing the medial axis of a simple polygon P is given, which answers a long-standing open question—previously, the best deterministic algorithm ran in O(n log n) time.
...
1
2
...