4850 search results - page 880 / 970 » Proof and Computation in Geometry |
100
Voted
STOC
2003
ACM
16 years 27 days 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...
91
Voted
EUROGRAPHICS
2010
Eurographics
15 years 9 months ago
2010
Eurographics
We present a new intuitive UI, which we call cross-boundary brushes, for interactive mesh decomposition. The user roughly draws one or more strokes across a desired cut and our sy...
109
Voted
CVPR
2008
IEEE
15 years 7 months ago
2008
IEEE
We propose a 2D registration method for multi-modal image sequences of the retinal fundus, and a 3D metric reconstruction of near planar surface from multiple views. There are two...
121
Voted
SIBGRAPI
2008
IEEE
15 years 7 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...
101
Voted
TABLETOP
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we describe a method to support interaction with a cellphone based projectorcamera system. We describe a novel approach that uses a technique known in Computer Visio...