2093 search results - page 265 / 419 » Statistical Point Geometry |
157
click to vote
Publication
![Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]](https://sciweavers.org/files/imagecache/thumbnail/imagecache/mumphord_shah.jpg "Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]")
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
113
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
116
Voted
FOCS
2009
IEEE
15 years 9 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...
124
Voted
SMA
2009
ACM
15 years 9 months ago
2009
ACM
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...
133
click to vote
SIBGRAPI
2008
IEEE
15 years 8 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...