Property Testing with Geometric Queries

This paper investigates geometric problems in the context of property testing algorithms. Property testing is an emerging area in computer science in which one is aiming at verifying whether a given object has a predetermined property or is "far" from any object having the property. Although there has been some research previously done in testing geometric properties, prior works have been mostly dealing with the study of combinatorial notion of the distance defining whether an object is "far" or it is "close"; very little research has been done for geometric notion of distance measures, that is, distance measures that are based on the geometry underlying input objects. The main objective of this work is to develop sound models to study geometric problems in the context of property testing. Comparing to the previous work in property testing, there are two novel aspects developed in this paper: geometric measures of being close to an object having the predetermined property, and the use of geometric data structures as basic primitives to design the testers.We believe that the second aspect is of special importance in the context of property testing and that the use of specialized data structures as basic primitives in the testers can be applied to other important problems in this area. We shall discuss a number of models that in our opinion fit best geometric problems and apply them to study geometric properties for three very fundamental and representative problems in the area: testing convex position, testing map labeling, and testing clusterability.

[1]  Kurt Mehlhorn,et al.  A complete roundness classification procedure , 1997, SCG '97.

[2]  Madhav V. Marathe,et al.  Map labeling and its generalizations , 1997, SODA '97.

[3]  C. Yap.  Exact computational geometry and tolerancing metrology , 1994 .

[4]  Noga Alon,et al.  Testing of clustering , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5]  Artur Czumaj,et al.  Property Testing in Computational Geometry , 2000, ESA.

[6]  Prosenjit Bose,et al.  Testing the Quality of Manufactured Balls , 1999, WADS.

[7]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

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

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

[10]  Chee Yap,et al.  Issues in the metrology of geometric tolerancing (invited talk: 2nd Workshop on Algorithmic Foundations of Robotics, WAFR) , 1997 .

[11]  Alan M. Frieze,et al.  Quick Approximation to Matrices and Applications , 1999, Comb..

[12]  Pankaj K. Agarwal,et al.  Exact and Approximation Algortihms for Clustering , 1997 .

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

[14]  Oded Goldreich,et al.  Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.

[15]  Ilan Newman.  Testing of function that have small width branching programs , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[16]  Frank Wagner,et al.  A packing problem with applications to lettering of maps , 1991, SCG '91.

[17]  Ronitt Rubinfeld,et al.  Spot-Checkers , 2000, J. Comput. Syst. Sci..

[18]  Michael T. Goodrich,et al.  Efficient approximation and optimization algorithms for computational metrology , 1997, SODA '97.

[19]  Prosenjit Bose,et al.  Testing the Quality of Manufactured Disks and Cylinders , 1998, ISAAC.

[20]  Ee-Chien Chang,et al.  Issues in the Metrology of Geometric Tolerancing , 1996 .

[21]  MaratheMadhav,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998 .

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