The Complexity of an Adaptive Subdivision Method for Approximating Real Curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

The Complexity of an Adaptive Subdivision Method for Approximating Real Curves

Michael Burr
  • Function : Author
  • PersonId : 1008975
Shuhong Gao
  • Function : Author
  • PersonId : 1008976
Elias Tsigaridas

Abstract

We present the first complexity analysis of the algorithm by Plantinga and Vegter for approximating real implicit curves and surfaces. This approximation algorithm certifies the topological correctness of the output using both subdivision and interval arithmetic. In practice, it has been seen to be quite efficient; our goal is to quantify this efficiency. We focus on the subdivision step (and not the approximation step) of the Plantinga and Vegter algorithm. We begin by extending the subdivision step to arbitrary dimensions. We provide a priori worst-case bounds on the complexity of this algorithm both in terms of the number of subregions constructed and the bit complexity for the construction. Then, we use continuous amortization to derive adaptive bounds on the complexity of the subdivided region. We also provide examples showing our bounds are tight.
Fichier principal
Vignette du fichier
PVPaper.pdf (889.42 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01528392 , version 1 (29-05-2017)
hal-01528392 , version 2 (30-05-2017)

Identifiers

Cite

Michael Burr, Shuhong Gao, Elias Tsigaridas. The Complexity of an Adaptive Subdivision Method for Approximating Real Curves. ISSAC 2017 - International Symposium on Symbolic and Algebraic Computation, Jul 2017, Kaiserslautern, Germany. pp.8, ⟨10.1145/3087604.3087654⟩. ⟨hal-01528392v2⟩
216 View
232 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More