1018 search results - page 37 / 204 » Property Testing in Computational Geometry |
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
Shape completion is an intriguing problem in geometry processing with applications in CAD and graphics. This paper defines a new type of 3D curves, which can be utilized for curv...
COMPGEOM
1997
ACM
14 years 3 months ago
1997
ACM
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
IDA
2009
Springer
14 years 3 months ago
2009
Springer
Knowledge extraction from data volumes of ever increasing size requires ever more flexible tools to facilitate interactive query. Interactivity enables real-time hypothesis testin...
STOC
1991
ACM
14 years 2 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...