85 search results - page 5 / 17 » On Minimum Circular Arrangement |
IJSNET
2008
13 years 7 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
PPOPP
2005
ACM
14 years 1 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
JGO
2010
13 years 6 months ago
2010
In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Population Basin Hopping to solve the problem of packing equal and unequal circles wit...
COMPGEOM
2003
ACM
14 years 29 days ago
2003
ACM
Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using fl...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper describes a new and simple method of recovering the geometry of uncalibrated circular motion or single axis motion using a minimal data set of 2 points in 4 images. Thi...