The Complexity of an Adaptive Subdivision Method for Approximating Real Curves

DOI10.1145/3087604.3087654zbMath1457.65013OpenAlexW2619629350MaRDI QIDQ5119923

Elias P. Tsigaridas, Michael A. Burr, Shuhong Gao

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3087604.3087654

zbMATH Keywords

worst-case boundsalgorithmic complexitycontinuous amortizationadaptive boundscurve and surface approximation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Functional norms, condition numbers and numerical algorithms in algebraic geometry ⋮ Certified numerical real root isolation for bivariate nonlinear systems ⋮ On the complexity of the Plantinga-Vegter algorithm ⋮ On the topology and isotopic meshing of plane algebraic curves ⋮ Condition numbers for the cube. I: Univariate polynomials and hypersurfaces ⋮ The complexity of subdivision for diameter-distance tests

This page was built for publication: The Complexity of an Adaptive Subdivision Method for Approximating Real Curves