Property testing in computational geometry

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1879, Issue , 2000, Pages 155-166

  Czumaj, Artur ^a   Sohler, Christian ^b   Ziegler, Martin ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; COMPUTATIONAL GEOMETRY; GEOMETRY;

GEOMETRIC PROPERTIES; OBJECT DESCRIPTION; PROPERTY-TESTING; RUNNING TIME; TESTING ALGORITHM;

COMPUTATIONAL GEOMETRY; ALGORITHMS;

EID: 84927160662     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_15     Document Type: Article

References (16)

1. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy. Efficient testing of large graphs. In Proc. 40th IEEE FOCS, pp. 656-666, 1999.
2. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy. Regular languages are testable with a constant number of queries. In Proc. 40th IEEE FOCS, pp. 645-655, 1999.
3. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. N¨aher, S. Schirra, and C. Uhrig. Algorithmica, 8(5/6):365-389, 1992.
4. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549-595, 1993.
5. T. M. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. Discrete & Computational Geometry, 16:369-387, 1996.
6. M. Dyer and N. Megiddo. Linear programming in low dimensions. In J. E. Goodman and J. O’Rourke, eds., Handbook of Discrete and Computational Geometry, ch. 38, pp. 699-710, CRC Press, Boca Raton, FL, 1997.
7. F. Ergün, S. Kannan, S. Ravi Kumar, R. Rubinfeld, and M. Viswanathan. Spot-checkers. In Proc. 30th ACM STOC, pp. 259-268, 1998.
8. F. Ergün, S. Ravi Kumar, and R. Rubinfeld. Approximate checking of polynomials and functional equations. In Proc. 37th IEEE FOCS, pp. 592-601, 1996.
9. O. Goldreich, S. Goldwasser, E. Lehman, and D. Ron. Testing monotonicity. In Proc. 39th IEEE FOCS, pp. 426-435, 1998.
10. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, 1998.
11. O. Goldreich and D. Ron. Property testing in bounded degree graphs. In Proc. 29th ACM STOC, pp. 406-415, 1997.
12. O. Goldreich and D. Ron. A sublinear bipartiteness tester for bounded degree graphs. Combinatorica, 19(3):335-373, 1999.
13. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete & Computational Geometry, 2:127-151, 1987.
14. K. Mehlhorn, S. Näher, M. Seel, R. Seidel, T. Schilz, S. Schirra, and C. Uhrig. Checking geometric programs or verification of geometric structures. Computational Geometry: Theory and Applications, 12:85-103, 1999.
15. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
16. R. Rubinfeld. Robust functional equations and their applications to program testing. In Proc. 35th IEEE FOCS, pp. 288-299, 1994.