Sciweavers

557 search results - page 45 / 112
» On the set multi-cover problem in geometric settings
Sort
View
CVPR
2010
IEEE
14 years 5 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...
COMPGEOM
2005
ACM
13 years 11 months ago
Hadwiger and Helly-type theorems for disjoint unit spheres in R3
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
Otfried Cheong, Xavier Goaoc, Andreas Holmsen
CCCG
2008
13 years 10 months ago
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
Yurai Núñez Rodríguez, Henry ...
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 9 months ago
Hadwiger and Helly-type theorems for disjoint unit spheres
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Syl...
ICNSC
2008
IEEE
14 years 3 months ago
Facility Location Optimization via Multi-Agent Robotic Systems
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
Miad Moarref, Hassan Sayyadi