2251 search results - page 408 / 451 » Geometric Algorithms on CUDA |
137
Voted
COMGEO
2006
ACM
15 years 17 days ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
117
Voted
PAMI
2008
15 years 15 days ago
2008
The Expectation Maximization (EM) algorithm is widely used for learning finite mixture models despite its greedy nature. Most popular model-based clustering techniques might yield...
120
click to vote
SMA
2008
ACM
15 years 14 days ago
2008
ACM
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
101
Voted
IJRR
2002
15 years 7 days ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
129
Voted
BMCBI
2011
14 years 4 months ago
2011
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...