NANAJul 5, 2017

Fast Approximate Implicitization of Envelope Curves using Chebyshev Polynomials

arXiv:1707.012293 citations
Originality Synthesis-oriented
AI Analysis

For researchers in geometric modeling, this offers a faster approximation technique for envelope curves, though it is an incremental improvement over existing approximate implicitization.

The authors propose an efficient approximate implicitization method for envelope curves using Chebyshev polynomials, reducing computational cost compared to exact methods. An example demonstrates improved performance.

Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly, we employ an adaptation of approximate implicitization to envelope computation. Moreover, by utilizing an orthogonal basis in the construction process, the computational times can be shortened and the numerical condition improved. We provide an example to illustrate the performance of our approach.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes