A Modified Douglas-Peucker simplification algorithm : a consistent displacement line simplification (Book, 1996) [WorldCat.org]
skip to content
New WorldCat.org coming soon
A Modified Douglas-Peucker simplification algorithm : a consistent displacement line simplification
Checking...

A Modified Douglas-Peucker simplification algorithm : a consistent displacement line simplification

Author: Yanyan Zhang; Alan Saalfeld; Ohio State University. Department of Geodetic Science and Surveying,
Publisher: [Columbus] : Ohio State University, 1996.
Dissertation: M.S. Ohio State University 1996
Edition/Format:   Thesis/dissertation : Thesis/dissertation : Manuscript   Archival Material : EnglishView all editions and formats
Summary:
Displacement consistency has remained a challenging problem in line simplification. Though it is often considered the best line simplification algorithm, the Douglas-Peucker algorithm, however, like most line simplification algorithms, does not take into account displacement consistency. Assume there is a chain c with n vertices, a point set P with m points scattering along the two sides of c and also there are  Read more...

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Academic Dissertation
Academic theses
Thèses et écrits académiques
Additional Physical Format: Online version:
Zhang, Yanyan, 1968-
Modified Douglas-Peucker simplification algorithm
(OCoLC)896826603
Material Type: Thesis/dissertation, Manuscript
Document Type: Book, Archival Material
All Authors / Contributors: Yanyan Zhang; Alan Saalfeld; Ohio State University. Department of Geodetic Science and Surveying,
OCLC Number: 36144658
Notes: Includes vita.
Description: xi, 67 leaves : illustrations
Responsibility: by Yanyan Zhang.

Abstract:

Displacement consistency has remained a challenging problem in line simplification. Though it is often considered the best line simplification algorithm, the Douglas-Peucker algorithm, however, like most line simplification algorithms, does not take into account displacement consistency. Assume there is a chain c with n vertices, a point set P with m points scattering along the two sides of c and also there are other chains lying beside chain c. A line simplification algorithm is said to have displacement consistency for c only if each of the points in P and each of the vertices in other chains remains on the same side of the simplified c after applying the algorithm. n this thesis, the Douglas-Peucker algorithm is modified to achieve displacement consistency. The key point of the modification is: checking will be done for all the points and vertices that will potentially interfere with the simplified chain before each vertex elimination, and guarantee simplification only happens when it is safe. There are two method given for choosing "characteristic" vertex after encountering unsafe points.

Reviews

Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.