420 search results - page 55 / 84 » Discrete mobile centers |
170
click to vote
COMPGEOM
2006
ACM
15 years 11 months 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...
147
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
171
click to vote
COMPGEOM
2010
ACM
15 years 10 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...
174
Voted
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
195
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...