140 search results - page 11 / 28 » Computing the visibility graph of points within a polygon |
121
click to vote
ICRA
2000
IEEE
15 years 4 months ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
101
click to vote
CCCG
2008
15 years 1 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
136
Voted
MVA
2008
14 years 11 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
ICDCSW
2003
IEEE
15 years 5 months ago
2003
IEEE
The university campus is an interesting application environment for the ubiquitous computing paradigm: a large number of users share a substantial amount of their information need...
107
click to vote
EUROPAR
2007
Springer
15 years 5 months ago
2007
Springer
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...