2188 search results - page 122 / 438 » Instance-Optimal Geometric Algorithms |
142
Voted
SGP
2004
15 years 5 months ago
2004
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
151
Voted
IPCO
2008
15 years 4 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
123
click to vote
JC
2007
15 years 2 months ago
2007
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
117
Voted
GIS
2010
ACM
15 years 1 months ago
2010
ACM
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under ...
116
click to vote
EUC
2005
Springer
15 years 8 months ago
2005
Springer
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...