Abstract
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.
Research supported in part by an SBR grant No. 421090, by DFG grant Me872/7-1, and by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Agarwal. Range searching. Chapter 31 in J. E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, CRC Press, 1997.
P. K. Agarwal, C. M. Procopiuc. Exact and approximation algorithms for clustering. Proc. 9th ACM-SIAM SODA, pp. 658–667, 1998.
N. Alon, S. Dar, M. Pamas, and D. Ron. Testing of clustering. Proc. 41st IEEE FOCS, pp. 240–250, 2000.
N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy. Efficient testing of large graphs. Proc. 40th IEEE FOCS, pp. 656–666, 1999.
P. Bose and P. Morin. Testing the quality of manufactured disks and cylinders. Proc. 9th ISAAC, pp. 129–138, 1998.
P. Bose and P. Morin. Testing the quality of manufactures balls. Proc. 6th WADS, pp. 145–156, 1999.
A. Czumaj, C. Sohler, and M. Ziegler. Property testing in computational geometry. Proc. 8th ESA, pp. 155–166, 2000.
C. A. Duncan, M. T. Goodrich, and E. A. Ramos. Efficient approximation and optimization algorithms for computational metrology. Proc. 8th ACM-SIAM SODA, pp. 121–130, 1997.
S. Doddi, M. Marathe, A. Mirzaian, B. Moret, and B. Zhu. Map labeling and its generalizations. Proc. 8th ACM-SIAM SODA, pp. 148–157, 1997.
F. Ergün, S. Kannan, S. R. Kumar, R. Rubinfeld, and M. Viswanathan. Spot-checkers. JCSS, 60:717–751, 2000.
M. Formann and F. Wagner. A packing problem with applications to lettering of maps. Proc. 7th ACM SoCG, pp. 281–288, 1991.
A. Frieze and R. Kannan. Quick approximation to matrices and applications. Combinatorica, 19:175–220, 1999.
O. Goldreich. Combinatorial property testing (A survey). Proc. DIMACS Workshop on Randomization Methods in Algorithm Design, pp. 45–59, 1997.
O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653–750, 1998.
O. Goldreich and D. Ron. A sublinear bipartiteness tester for bounded degree graphs. Combinatorica, 19(3):335–373, 1999.
H. B. Hunt M. V. Marather, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. NC-approximation schemes for NP-and PSPACE-hard problems for geometric graphs. J. Algorithms, 26(2):238–274, 1998.
K. Mehlhorn, T. C. Shermer, and C. K. Yap. A complete roundness classification procedure. Proc. 13th ACM SoCG, pp. 129–138, 1997.
D. Ron. Property testing. To appear in Handobook of Randomized Algorithms, P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, eds., Kluwer Academic Publishers.
C. Yap. Exact computational geometry and tolerancing metrology. In D. Avis and J. Bose, editors, Snapshots of Computational and Discrete Geometry, volume 3. McGill School of Computer Science, 1995. Technical Report SOCS-94.50.
C. Yap and E.-C. Chang. Issues in the metrology of geometric tolerancing. Proc. 2nd Workshop on Algorithmic Foundations of Robotics, pp. 393–400, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czumaj, A., Sohler, C. (2001). Property Testing with Geometric Queries. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_22
Download citation
DOI: https://doi.org/10.1007/3-540-44676-1_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42493-2
Online ISBN: 978-3-540-44676-7
eBook Packages: Springer Book Archive