| Autor: |
Han, Sangjun, Yoon, Seung-Hyun, Kim, Myung-Soo, Elber, Gershon |
| Předmět: |
|
| Zdroj: |
Visual Computer; Jun2019, Vol. 35 Issue 6-8, p921-933, 13p |
| Abstrakt: |
We present an efficient algorithm for computing the Minkowski sum of two planar geometric models bounded by B-spline curves. The boundary curves are first approximated by G 1 -biarc splines within a given error bound ϵ > 0 . A superset of Minkowski sum boundary is then generated using the biarc approximations. For non-convex models, the superset contains redundant arcs. An efficient and robust elimination of the redundancies is the main challenge of Minkowski sum computation. For this purpose, we use the Minkowski sum of interior disks of the two input models, which are again disks in the Minkowski sum interior. The majority of redundant arcs are eliminated by testing each against a small number of interior disks selected for efficiency. From the planar arrangement of remaining arcs, we construct the Minkowski sum boundary in a correct topology. We demonstrate a real-time performance and the stability of circle-based Minkowski sum computation using a large set of test data. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink