Property testing in computational geometry. (Extended abstract)

DOI10.1007/3-540-45253-2_15MaRDI QIDQ2753932zbMATH OpenFDO

Authors Christian Sohler, Martin Ziegler, Artur Czumaj

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45253-2_15

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Property testing with geometric queries (extended abstract)
• scientific article; zbMATH DE number 1241385
• Testing geometric objects
• Abstract Combinatorial Programs and Efficient Property Testers
• Property testing and its connection to learning and approximation

Cited in

(20)

• A large lower bound on the query complexity of a simple Boolean function
• Testing geometric objects
• Testing orthogonal shapes
• Testing hypergraph colorability
• Property testing for point sets on the plane
• Property testing and expansion in cubical complexes
• Experience report: growing and shrinking polygons for random testing of computational geometry algorithms
• scientific article; zbMATH DE number 2079317 (Why is no real title available?)
• Helly-type theorems in property testing
• Property testing with geometric queries (extended abstract)
• Sublinear-time Algorithms
• Testing Euclidean Spanners
• Sample-based high-dimensional convexity testing
• Testing convexity of figures under the uniform distribution
• Approximate testing of visual properties
• Testing subgraphs in directed graphs
• The power and limitations of uniform samples in testing properties of figures
• Property testing of LP-type problems
• Property testing of curve similarity
• Lower bounds for testing Euclidean minimum spanning trees

This page was built for publication: Property testing in computational geometry. (Extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753932)