--- res: bibo_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.\r\n\r\nThe 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.\r\n\r\nWe 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.@eng" bibo_authorlist: - foaf_Person: foaf_givenName: Christian foaf_name: Sohler, Christian foaf_surname: Sohler - foaf_Person: foaf_givenName: Artur foaf_name: Czumaj, Artur foaf_surname: Czumaj bibo_doi: 10.1007/3-540-44676-1_22 dct_date: 2001^xs_gYear dct_language: eng dct_title: Property Testing with Geometric Queries@ ...