Title
Solving the horizontal conflation problem with a constrained Delaunay triangulation.
Abstract
Datasets produced by different countries or organisations are seldom properly aligned and contain several discrepancies (e.g., gaps and overlaps). This problem has been so far almost exclusively tackled by snapping vertices based on a user-defined threshold. However, as we argue in this paper, this leads to invalid geometries, is error-prone, and leaves several discrepancies along the boundaries. We propose a novel algorithm to align the boundaries of adjacent datasets. It is based on a constrained Delaunay triangulation to identify and eliminate the discrepancies, and the alignment is performed without moving vertices with a snapping operator. This allows us to guarantee that the datasets have been properly conflated and that the polygons are geometrically valid. We present our algorithm, our implementation (based on the stable and fast triangulator in CGAL), and we show how it can be used it practice with different experiments with real-world datasets. Our experiments demonstrate that our approach is highly efficient and that it yields better results than snapping-based methods.
Year
DOI
Venue
2017
10.1007/s10109-016-0237-7
Journal of Geographical Systems
Keywords
Field
DocType
Conflation, Edge-matching, Triangulation, Boundary alignment, Data quality, C02
Conflation,Polygon,Mathematical optimization,Vertex (geometry),Algorithm,Edge matching,Triangulation (social science),Operator (computer programming),Statistics,Constrained Delaunay triangulation,Mathematics
Journal
Volume
Issue
ISSN
19
1
1435-5949
Citations 
PageRank 
References 
0
0.34
4
Authors
2
Name
Order
Citations
PageRank
Hugo Ledoux123122.27
Ken Arroyo Ohori2468.14