Property testing in computational geometry

Document Type

Article

Publication Date

1-1-2000

Abstract

We consider the notion of property testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is “far” from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.

Identifier

84927160662 (Scopus)

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/3-540-45253-2_15

e-ISSN

16113349

ISSN

03029743

First Page

155

Last Page

166

Volume

1879

Grant

Me872/7-1

This document is currently not available here.

Share

COinS