Sciweavers

6365 search results - page 255 / 1273
» Fast Local Computation Algorithms
Sort
View
GIS
2010
ACM
15 years 5 months ago
Decentralized querying of topological relations between regions without using localization
This paper proposes an efficient, decentralized algorithm for determining the topological relationship between two regions monitored by a geosensor network. Many centralized algo...
Matt Duckham, Myeong Hun Jeong, Sanjiang Li, Joche...
ISVC
2009
Springer
16 years 1 months ago
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
Given a Cylindrical Algebraic Decomposition of an implicit algebraic curve, visualizing distinct curve arcs is not as easy as it stands because, despite the absence of singularitie...
Pavel Emeliyanenko, Eric Berberich, Michael Sagral...
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
Fast and Efficient Skinning of Animated Meshes
Skinning is a simple yet popular deformation technique combining compact storage with efficient hardware accelerated rendering. While skinned meshes (such as virtual characters) a...
Ladislav Kavan, Peter-Pike Sloan, Carol O'Sullivan
CVPR
2011
IEEE
15 years 4 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes
COMPGEOM
2009
ACM
16 years 1 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray