Clarification of the Relative Minimum Distance (RMD) Theorems and the real-time arclength algorithm
Overview & Synopsis
The well-known Bresenham and the midpoint algorithm of Pitteway and Van Aken belong to the RMD algorithms. The RMD theorem proves why they have the highest accuracy and the fastest real-time execution time. Nowadays the RMD's have constant feedrate and they even measure the rounded arclength in real time. That was until now a main property of the Pythagorean-hodograph curves of Farouki, which also have applications in offsetting curves. The RMD algorithms implement the basic offset curves from the connected points, the implementation with the high degree PH-curves is complex. This paper proves that everyone can generate a "classic" OoA error and that everyone can correct that OoA error at an amazingly straightforward way, and furthermore the OoARange is inversely proportional with the rounded radius. Therefore, rejecting RMD algorithms for the sake of OoA is hair-splitting.
hal.science)
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Clarification of the Relative Minimum Distance (RMD) Theorems and the real-time arclength algorithm |
|---|---|
| Author / Organization | Valere Huypens |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2022 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-167721 |
| Original Source Link | Visit Source Page on hal.science » |