DeepAI AI Chat
Log In Sign Up

The Complexity of Subdivision for Diameter-Distance Tests

01/17/2018
by   Michael Burr, et al.
Inria
Clemson University
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/05/2019

Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing

We study the group testing problem with non-adaptive randomized algorith...
04/15/2020

On the Complexity of the Plantinga-Vegter Algorithm

We introduce a general toolbox for precision control and complexity anal...
01/16/2023

Computing Distance-based metrics on Very Large Graphs

We propose PROPAGATE, a fast approximation framework to estimate distanc...
11/14/2019

Refining Tournament Solutions via Margin of Victory

Tournament solutions are frequently used to select winners from a set of...
03/16/2023

Optimal Volume-Sensitive Bounds for Polytope Approximation

Approximating convex bodies is a fundamental question in geometry and ha...
08/08/2018

Bounds for the diameter of the weight polytope

A weighted game or a threshold function in general admits different weig...