On the Complexity of the Plantinga-Vegter Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete and Computational Geometry Year : 2022

On the Complexity of the Plantinga-Vegter Algorithm

Abstract

We introduce a general toolbox for precision control and complexity analysis of subdivision based algorithms in computational geometry. We showcase the toolbox on a well known example from this family; the adaptive subdivision algorithm due to Plantinga and Vegter. The only existing complexity estimate on this rather fast algorithm was an exponential worst-case upper bound for its interval arithmetic version. We go beyond the worst-case by considering smoothed analysis, and prove polynomial time complexity estimates for both interval arithmetic and finite precision versions of the Plantinga-Vegter algorithm. The employed toolbox is a blend of robust probabilistic techniques coming from geometric functional analysis with condition numbers and the continuous amortization paradigm introduced by Burr, Krahmer and Yap. We hope this combination of tools from different disciplines would prove useful for understanding complexity aspects of the broad family of subdivision based algorithms in computational geometry.
Fichier principal
Vignette du fichier
On_the_Complexity_of_the_Plantinga_Vegter_algorithm (2).pdf (517.32 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02552018 , version 1 (22-12-2020)

Identifiers

Cite

Felipe Cucker, Alperen A. Ergür, Josué Tonelli-Cueto. On the Complexity of the Plantinga-Vegter Algorithm. Discrete and Computational Geometry, 2022, ⟨10.1007/s00454-022-00403-x⟩. ⟨hal-02552018⟩
101 View
134 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More