A non-self-intersection Douglas-Peucker algorithm

@article{Wu2003AND,
  title={A non-self-intersection Douglas-Peucker algorithm},
  author={Shin-Ting Wu and Mercedes Roc{\'i}o Gonzales M{\'a}rquez},
  journal={16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003)},
  year={2003},
  pages={60-66}
}
  • Shin-Ting Wu, M. Márquez
  • Published 27 October 2003
  • Computer Science, Mathematics
  • 16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003)
The classical Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It is used extensively for both computer graphics and geographic information systems. There are two variants of this algorithm, the original O(nm) method, where n denotes the number of input vertices and m the number of output segments, that works in any dimension, and the O(nlogn) one, which only works for simple 2D planar polylines. In… 
Robust line simplification on the plane
TLDR
A robust and easy-to-implement variation of the Douglas-Peucker algorithm for individual line simplification in two dimensions is presented and the robustness of the new algorithm is based on the concept of intersection of segments and it can be easily implemented in parallel.
A Vector Line Simplification Algorithm Based on the Douglas-Peucker Algorithm, Monotonic Chains and Dichotomy
TLDR
A new vector line simplification algorithm based on the D–P algorithm, monotonic chains and dichotomy, is proposed in this paper, which solves the problem of self-intersection.
Efficiently Generating Multiple Representations for Web Mapping
TLDR
An improvement to Saalfeld's algorithm to detect possible self-intersections of a simplified polyline more efficiently is proposed and integrated into a web mapping system that pre-computes a sequence of topologically consistent map representations, stores them on the server, and transmits them progressively upon request.
Efficient and consistent line simplification for web mapping
TLDR
An improved version of Saalfeld's algorithm to detect possible self-intersections more efficiently is developed and integrated into a web-mapping system that relies on progressive transmission.
A MASSIVELY PARALLEL LINE SIMPLIFICATION ALGORITHM USING AN ASSOCIATIVE COMPUTING MODEL
Line simplification is a process of reducing the number of line segments and vertices to represent a polyline. This reduction in the number of line segments and vertices can improve the performance
A Massively Parallel Algorithm for Polyline Simplification Using an Associative Computing Model
Line simplification is a process of reducing the number of line segments to represent a polyline. This reduction in the number of line segments and vertices can improve the performance of spatial
Approximating shapes in images with low-complexity polygons
TLDR
An algorithm for extracting and vectorizing objects in images with polygons is presented, which refines the geometry of the partition while labeling its cells by a semantic class and demonstrates its efficiency compared to existing vectorization methods.
Enriched geometric simplification of linear features
Polyline geometries are used to represent linear features, such as roads, rivers and pipelines on maps. The generalization process results in a polyline that represents the feature either at a
Algorithms for Geometric Covering and Piercing Problems
This thesis involves the study of a range of geometric covering and piercing problems, where the unifying thread is approximation using disks. While some of the problems addressed in this work are
A Massively Parallel Line Simplification Algorithm Implemented Using Chapel
Line simplification is a process of reducing the number of line segments to represent a polyline. This reduction in the number of line segments and vertices can improve the performance of spatial
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Topologically Consistent Line Simplification with the Douglas-Peucker Algorithm
We examine key properties of the Douglas-Peucker polyline simplification algorithm which are shared with many similar "vertex sub-sampling" algorithms. We examine how the Douglas-Peucker algorithm
Speeding Up the Douglas-Peucker Line-Simplification Algorithm
We analyze the line simplification algorithm reported by Douglas and Peucker and show that its worst case is quadratic in n, the number of input points. Then we give a algorithm, based on path hulls,
An iterative procedure for the polygonal approximation of plane curves
  • U. Ramer
  • Mathematics, Computer Science
    Comput. Graph. Image Process.
  • 1972
TLDR
An approximation algorithm is presented which uses an iterative method to produce polygons with a small—but not minimum—number of vertices that lie on the given curve that justifies the abandonment of the minimum-vertices criterion.
Line generalisation by repeated elimination of points
TLDR
A new approach to line generalisation which uses the concept of 'effective area' for progressive simplification of a line by point elimination and offers scope for modelling cartographic lines as consisting of features within features so that their geometric manipulation may be modified by application- and/or user-defined rules and weights.
Problems Arising From A Simple GIS Generalisation Algorithm
TLDR
This paper addresses two fundamental problems with this simple algorithm: performing topologically consistent line generalisation that preserves polygon adjacencies; and establishing criteria and operators for selection of polygons as candidates for elimination.
ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE
All digitizing methods, as a general rule, record lines with far more data than is necessary for accurate graphic reproduction or for computer analysis. Two algorithms to reduce the number of points
Reconstructing a 3D model from range images using radial flow model
  • R. Marques da Silva, Wu Shin-Ting
  • Mathematics
    Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)
  • 1998
The reconstruction of a 3D model from range images can be conveniently split into two stages. The first stage consists basically in the extraction of geometrical information, e.g. the depth and the
LINES, COMPUTERS, AND HUMAN FRAILTIES*
TLDR
Geographers and cartographers, in their rush to implement computer cartographic systems, have tended to overlook problems of human error, which seriously affect representations of naturally occurring lines such as rivers and coasts.
Point in Polygon Strategies
Optimizing curve segmentation in computer graphics
  • Proceedings of the International Computing Symposium
  • 1974
...
1
2
...