2980 search results - page 570 / 596 » Computational Geometry |
145
click to vote
VMV
2004
15 years 4 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
104
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
115
Voted
JUCS
2010
15 years 1 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
144
click to vote
PVLDB
2010
15 years 1 months ago
2010
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
181
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
This paper deals with estimation of dense optical flow
and ego-motion in a generalized imaging system by exploiting
probabilistic linear subspace constraints on the flow.
We dea...