Sciweavers

2251 search results - page 408 / 451
» Geometric Algorithms on CUDA
Sort
View
COMGEO
2006
ACM
14 years 9 months ago
Computing homotopic shortest paths efficiently
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...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
PAMI
2008
161views more  PAMI 2008»
14 years 9 months ago
TRUST-TECH-Based Expectation Maximization for Learning Finite Mixture Models
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...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Voronoi diagram computations for planar NURBS curves
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...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber
IJRR
2002
129views more  IJRR 2002»
14 years 9 months ago
Deformable Free-Space Tilings for Kinetic Collision Detection
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...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
BMCBI
2011
14 years 1 months ago
MINE: Module Identification in NEtworks
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
Kahn Rhrissorrakrai, Kristin C. Gunsalus