The Complexity of Subdivision for Diameter-Distance Tests

Michael Burr 1 Shuhong Gao 1 Elias Tsigaridas 2
2 PolSys - Polynomial Systems
Inria de Paris, LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We present a general framework for analyzing the complexity of subdivision-based algorithms whose tests are based on the sizes of regions and their distance to certain sets (often varieties) intrinsic to the problem under study. We call such tests diameter-distance tests. We illustrate that diameter-distance tests are common in the literature by proving that many interval arithmetic-based tests are, in fact, diameter-distance tests. For this class of algorithms, we provide both non-adaptive bounds for the complexity, based on separation bounds, as well as adaptive bounds, by applying the framework of continuous amortization. Using this structure, we provide the first complexity analysis for the algorithm by Plantinga and Vegeter for approximating real implicit curves and surfaces. We present both adaptive and non-adaptive a priori worst-case bounds on the complexity of this algorithm both in terms of the number of subregions constructed and in terms of the bit complexity for the construction. Finally, we construct families of hypersurfaces to prove that our bounds are tight.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/hal-01953446
Contributor : Elias Tsigaridas <>
Submitted on : Wednesday, December 12, 2018 - 11:55:28 PM
Last modification on : Wednesday, March 27, 2019 - 1:36:10 AM
Document(s) archivé(s) le : Wednesday, March 13, 2019 - 4:03:29 PM

File

PV Paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01953446, version 1

Citation

Michael Burr, Shuhong Gao, Elias Tsigaridas. The Complexity of Subdivision for Diameter-Distance Tests. Journal of Symbolic Computation, Elsevier, In press. ⟨hal-01953446⟩

Share

Metrics

Record views

32

Files downloads

17