| Title: | Low-Rank Rational Approximation of Natural Trochoid Parameterizations |
| Authors: | Bálint, Csaba Valasek, Gábor Gergó, Lajos |
| Citation: | WSCG 2023: full papers proceedings: 1. International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, p. 292-299. |
| Issue Date: | 2023 |
| Publisher: | Václav Skala - UNION Agency |
| Document type: | konferenční příspěvek conferenceObject |
| URI: | http://hdl.handle.net/11025/54436 |
| ISBN: | 978-80-86943-32-9 |
| ISSN: | 2464–4617 (print) 2464–4625 (CD/DVD) |
| Keywords: | křivky;odhad;parametrizace délky oblouku;přirozená parametrizace |
| Keywords in different language: | curves;approximation;Arc-length parametrization;natural parametrization |
| Abstract in different language: | Arc-length or natural parametrization of curves traverses the shape with unit speed, enabling uniform sampling and straightforward manipulation of functions defined on the geometry. However, Farouki and Sakkalis proved that it is impossible to parametrize a plane or space curve as a rational polynomial of its arc-length, except for the straight line. Nonetheless, it is possible to obtain approximate natural parameterizations that are exact up to any epsilon. If the given family of curves possesses a small number of scalar degrees of freedom, this results in simple approximation formulae applicable in high-performance scenarios. To demonstrate this, we consider the problem of finding the natural parametrization of ellipses and cycloids. This requires the inversion of elliptic integrals of the second kind. To this end, we formulate a two-dimensional approximation problem based on machine-epsilon exact Chebhysev proxies for the exact solutions. We also derive approximate low-rank and low-degree rational natural parametrizations via singular value decomposition. The resulting formulae have minimal memory and computational footprint, making them ideal for computer graphics applications. |
| Rights: | © Václav Skala - UNION Agency |
| Appears in Collections: | WSCG 2023: Full Papers Proceedings |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| G41-full.pdf | Plný text | 4,7 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/54436Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.