The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections

Detalhes bibliográficos
Autor(a) principal: Wu,Shin-Ting
Data de Publicação: 2004
Outros Autores: Silva,Adler C. G. da, Márquez,Mercedes R. G.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Journal of the Brazilian Computer Society
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002004000100006
Resumo: The classic Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It may, however, produce simplified polyline that is not topologically equivalent to the original one consisting of all vertex samples. On the basis of properties of the polyline hulls, Saalfeld devised a simple rule for detecting topological inconsistencies and proposed to solve them by carrying additional refinements. In this paper, we present an alternative form for the classic Douglas-Peucker to produce a simplified polyline which is homeomorphic to the original one. Our modified Douglas-Peucker algorithm is based on two propositions: (1) when an original polyline is star-shaped, its simplification from the Douglas-Peucker procedure cannot self-intersect; and (2) for any polyline, two of its star-shaped sub-polylines may only intersect if there is a vertex of one simplified sub-polyline inside the other's corresponding region.
id UFRGS-28_96af282910555329786dccb9d5b65f0b
oai_identifier_str oai:scielo:S0104-65002004000100006
network_acronym_str UFRGS-28
network_name_str Journal of the Brazilian Computer Society
repository_id_str
spelling The Douglas-peucker algorithm: sufficiency conditions for non-self-intersectionsTopological ConsistencyLine SimplificationDouglas-Peucker AlgorithmGISThe classic Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It may, however, produce simplified polyline that is not topologically equivalent to the original one consisting of all vertex samples. On the basis of properties of the polyline hulls, Saalfeld devised a simple rule for detecting topological inconsistencies and proposed to solve them by carrying additional refinements. In this paper, we present an alternative form for the classic Douglas-Peucker to produce a simplified polyline which is homeomorphic to the original one. Our modified Douglas-Peucker algorithm is based on two propositions: (1) when an original polyline is star-shaped, its simplification from the Douglas-Peucker procedure cannot self-intersect; and (2) for any polyline, two of its star-shaped sub-polylines may only intersect if there is a vertex of one simplified sub-polyline inside the other's corresponding region.Sociedade Brasileira de Computação2004-04-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002004000100006Journal of the Brazilian Computer Society v.9 n.3 2004reponame:Journal of the Brazilian Computer Societyinstname:Sociedade Brasileira de Computação (SBC)instacron:UFRGS10.1590/S0104-65002004000100006info:eu-repo/semantics/openAccessWu,Shin-TingSilva,Adler C. G. daMárquez,Mercedes R. G.eng2010-05-25T00:00:00Zoai:scielo:S0104-65002004000100006Revistahttps://journal-bcs.springeropen.com/PUBhttps://old.scielo.br/oai/scielo-oai.phpjbcs@icmc.sc.usp.br1678-48040104-6500opendoar:2010-05-25T00:00Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)false
dc.title.none.fl_str_mv The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
title The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
spellingShingle The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
Wu,Shin-Ting
Topological Consistency
Line Simplification
Douglas-Peucker Algorithm
GIS
title_short The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
title_full The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
title_fullStr The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
title_full_unstemmed The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
title_sort The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
author Wu,Shin-Ting
author_facet Wu,Shin-Ting
Silva,Adler C. G. da
Márquez,Mercedes R. G.
author_role author
author2 Silva,Adler C. G. da
Márquez,Mercedes R. G.
author2_role author
author
dc.contributor.author.fl_str_mv Wu,Shin-Ting
Silva,Adler C. G. da
Márquez,Mercedes R. G.
dc.subject.por.fl_str_mv Topological Consistency
Line Simplification
Douglas-Peucker Algorithm
GIS
topic Topological Consistency
Line Simplification
Douglas-Peucker Algorithm
GIS
description The classic Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It may, however, produce simplified polyline that is not topologically equivalent to the original one consisting of all vertex samples. On the basis of properties of the polyline hulls, Saalfeld devised a simple rule for detecting topological inconsistencies and proposed to solve them by carrying additional refinements. In this paper, we present an alternative form for the classic Douglas-Peucker to produce a simplified polyline which is homeomorphic to the original one. Our modified Douglas-Peucker algorithm is based on two propositions: (1) when an original polyline is star-shaped, its simplification from the Douglas-Peucker procedure cannot self-intersect; and (2) for any polyline, two of its star-shaped sub-polylines may only intersect if there is a vertex of one simplified sub-polyline inside the other's corresponding region.
publishDate 2004
dc.date.none.fl_str_mv 2004-04-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002004000100006
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002004000100006
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0104-65002004000100006
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Computação
publisher.none.fl_str_mv Sociedade Brasileira de Computação
dc.source.none.fl_str_mv Journal of the Brazilian Computer Society v.9 n.3 2004
reponame:Journal of the Brazilian Computer Society
instname:Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
instname_str Sociedade Brasileira de Computação (SBC)
instacron_str UFRGS
institution UFRGS
reponame_str Journal of the Brazilian Computer Society
collection Journal of the Brazilian Computer Society
repository.name.fl_str_mv Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)
repository.mail.fl_str_mv jbcs@icmc.sc.usp.br
_version_ 1754734669611401216

Registros relacionados