Questions tagged [douglas-peucker]

An algorithm for reducing the number of points in a curve that is approximated by a series of points

The Douglas-Peucker algorithm is also known under the following names: the Ramer–Douglas–Peucker algorithm, the iterative end-point fit algorithm or the split-and-merge algorithm.

Links

20 questions
0
votes
1 answer

Best way to calculate Ramer-Douglas-Peucker tolerance

I am using an implementation of the Ramer Douglas Peucker algorithm to reduce the amount of points that I have for a map route. For example, if I have more than 500 points, I want to run the algorithm with a tolerance that will reduce the point…
Luke B
  • 288
  • 2
  • 5
  • 18
0
votes
1 answer

Is there a way to reduce the number of coordinates in a complex enclosed SVG path?

What I'd like to do is take an SVG shape drawn by an enclosed path (in this case, a region of a map) and reduce the number of points to create a simpler shape. I've tried implementing the Ramer-Douglas-Peucker algorithm to reduce the number of…
0
votes
1 answer

Coarsening a 2.5D triangulation

I have a 2D-delaunay-triangulation where each vertex is labeled with an elevation. I now want to remove vertices from the triangulation without making big changes to the form (analogous to douglas-peucker for polylines). There are a lot of…
user2033412
  • 1,950
  • 2
  • 27
  • 47
0
votes
1 answer

Could not find the "DouglasPeuckerEpsilon" in R language

I'm trying to use Douglas Peucker's algorithm in R. By executing the following code, I get the following error: Px <- (1:100)/10 Py <- dnorm(Px,3,1)+dnorm(Px,7,1)+Px/10 ### Example 1 ### Simplification using…
0
votes
1 answer

Drawing free-flow drawing tool in canvas

I researched about Douglas Peucker algorithm. Maybe I can use it as an alternative solution to just free flow my drawing. But my problem is that when I'm drawing, the previous drawn points are also moving. Is there any way to make the drawn lines…
ajbee
  • 3,511
  • 3
  • 29
  • 56
1
2