102291 search results - page 162 / 20459 » Computability in Computational Geometry |
157
click to vote
COMPGEOM
1998
ACM
15 years 9 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
153
click to vote
CVPR
1996
IEEE
15 years 9 months ago
1996
IEEE
We propose a new method for view synthesis from real images using stereo vision. The method does not explicitly model scene geometry, and enables fast and exact generation of synt...
138
Voted
GC
2010
Springer
15 years 3 months ago
2010
Springer
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
137
click to vote
CCCG
2009
15 years 2 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
142
click to vote
COMPGEOM
1997
ACM
15 years 9 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...