Property Testing in Computational Geometry (Extended 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.

[1]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[2]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[3]  Kurt Mehlhorn,et al.  Checking geometric programs or verification of geometric structures , 1996, SCG '96.

[4]  Ronitt Rubinfeld,et al.  Approximate checking of polynomials and functional equations , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[5]  Timothy M. Chan.  Output-sensitive results on convex hulls, extreme points, and related problems , 1996, Discret. Comput. Geom..

[6]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[7]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[8]  Nimrod Megiddo,et al.  Linear programming in low dimensions , 1997 .

[9]  Ronitt Rubinfeld,et al.  Spot-checkers , 1998, STOC '98.

[10]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[11]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  Dana Ron,et al.  A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1999, Comb..

[13]  Noga Alon,et al.  Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[14]  Dana Ron,et al.  Testing Monotonicity , 2000, Comb..