4850 search results - page 692 / 970 » Proof and Computation in Geometry |
207
click to vote
IBPRIA
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. It has recently been demonstrated that the fundamental computer vision problem of structure from motion with a single camera can be tackled using the sequential, probabil...
186
click to vote
COMPGEOM
2006
ACM
16 years 21 days ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
161
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
190
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
180
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...