The Ramer–Douglas–Peucker algorithm (aka "iterative end-point fit algorithm"), takes a curve composed of line segments and reduces the fidelty to a "lower fidelity" curve with fewer points.
Challenges
Featured Challenge:
#127 — Brownian Tree Snowflake
In this holiday coding challenge, I create a "Brownian Tree Snowflake" in Processing (Java). This video was recorded as part of a fundraiser for the Processing Foundation.
Filter by Language
Pick a language to filter
Filter by Topic
Ramer-Douglas-Peucker algorithm