One approach to drawing implicit 2D curves using interval analysis and Runge Method type.

Михайло Михайлович Олексин, Петро Сергійович Венгерський, Ярина Володимирівна Коковська

Анотація


Implicit curve approximation stands as a foundational task in both mathematics and computer graphics. Numerous approaches have been introduced to tackle this problem, from algebraic techniques to numerical methods. Among these, interval analysis has gained significant attention. Its strength lies in its inherent ability to provide guaranteed bounds, ensuring a robust estimate of the curve's location, a feature not consistently offered by many other methods. In this paper, we introduce an enhancement to the curve approximation algorithm, building upon the established foundation set by the [1] algorithm. Our primary objective is to optimize efficiency, with a particular emphasis on improving the boundary intersection determination. Our ambition is to speed up implicit curve approximation by using Runge method [2] instead of more traditional approach of using Newton method.

Повний текст:

PDF (English)

Посилання


John M. Snyder, "Interval analysis for computer graphics". Computer Graphics, 26(2):121-130, July 1992. https://dl.acm.org/doi/10.1145/142920.134024

P.S. Senio, P.S. Vengersky, "Solving systems of special form nonlinear equations by means of some modifcations of Runge type interval iterative method", Interval Computations, 4(6):59-65, 1992.

Long Lin, Chee Yap, "Adaptive isotopic approximation of nonsingular curves", 351-360, June 2009.

Michael Burr, Sung Woo Choi, Benjamin Galehouse, Chee K. Yap, "Complete subdivision algorithms", 87-94, July 2008

Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray, "Sampling and Meshing a Surface with Guaranteed Topology and Geometry", 2007.




DOI: http://dx.doi.org/10.30970/vam.2023.31.11974

Посилання

  • Поки немає зовнішніх посилань.