235 search results - page 17 / 47 » The Complexity of Separating Points in the Plane |
63
Voted
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
111
click to vote
SIAMCOMP
1998
14 years 9 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
COLT
2000
Springer
15 years 1 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
MOC
2010
14 years 4 months ago
2010
We introduce the concept of regular super-functions at a fixed point. It is derived from the concept of regular iteration. A super-function F of h is a solution of F(z+1)=h(F(z)). ...
ICIAP
1999
ACM
15 years 1 months ago
1999
ACM
The paper presents a new approach for shape recovery based on integratinggeometric and photometric information. We consider 3D bilaterally symmetric objects, that is, objects which...