3025 search results - page 449 / 605 » Computational geometry: a retrospective |
199
click to vote
COMPGEOM
2009
ACM
16 years 27 days ago
2009
ACM
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
176
click to vote
COMPGEOM
2009
ACM
16 years 27 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
193
click to vote
IBPRIA
2007
Springer
16 years 16 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...
180
click to vote
COMPGEOM
2006
ACM
16 years 10 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...
153
click to vote
COMPGEOM
2004
ACM
15 years 11 months 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...