Property Testing in Computational Geometry

Authors:
Artur Czumaj;Christian Sohler;Martin Ziegler
Affiliations:
-;-;-
Venue:
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Year:
2000

Citing 11
Cited 7

Self-testing/correcting with applications to numerical problems

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Property testing in bounded degree graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Spot-checkers

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Linear programming in low dimensions

Handbook of discrete and computational geometry
Checking geometric programs or verification of geometric structures

Selected papers from the 12th annual symposium on Computational Geometry
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
Testing Monotonicity

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Regular Languages are Testable with a Constant Number of Queries

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximate checking of polynomials and functional equations

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On the robustness of functional equations

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Property Testing with Geometric Queries

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Testing Euclidean spanners

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Sublinear-time algorithms

Property testing
Testing Euclidean spanners

Property testing
Sublinear-time algorithms

Property testing
Testing Euclidean spanners

Property testing
Online geometric reconstruction

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the notion of property testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is "far" from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.