|
Descripción
|
|
|---|---|
| Polyline simplification is an important task in map generalization. Several solutions have been developed in order to perform this task automatically, but the vast majority of them consider that the objective line to simplify is lying on the plane. One of the most widely used methods is the so-called Douglas--Peucker algorithm, which is fast and in most cases produces good results. However, the Douglas--Peucker method was defined in its original form in order to be applied to polylines contained in the Euclidean 2D space, and it can lead to inconsistent results such as self-intersections. In this work, a robust (results without self-intersections) variation of the Douglas--Peucker for polylines on the surface of the sphere is presented. It produces correct results regardless the morphology of the original line and the tolerance parameter size. The algorithm is coded in standard C99 and it can be compiled for serial or parallel execution via OpenMP. Both, the algorithm itself and a program implementing it are distributed as free software. The solution validity was tested using the GSHHG geography database, which can be obtained free through the Web. Results about output accuracy, execution speed, and parallel implementation scalability are presented. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
Computers & Geosciences |
|
ISSN
|
0098-3004 |
|
Factor de impacto JCR
|
1,562 |
|
Información de impacto
|
Datos JCR del año 2013 (Q1 en JCR 2014) |
|
Volumen
|
83 |
|
DOI
|
10.1016/j.cageo.2015.07.011 |
|
Número de revista
|
|
|
Desde la página
|
146 |
|
Hasta la página
|
152 |
|
Mes
|
OCTUBRE |
|
Ranking
|
Q1 en JCR 2014, que es el último por el momento |