138 search results - page 20 / 28 » K-Guarding Polygons on the Plane |
MMM
2003
Springer
14 years 29 days ago
2003
Springer
Computer animation is one of the key components of a multimedia document or presentation. Shape transformation between objects of different topology and positions is an open model...
ISPD
2000
ACM
14 years 2 days ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
WG
2010
Springer
13 years 6 months ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—In wireless sensor networks, multiple-coverage, in which each point is covered by more than one sensor, is often required to improve detection quality and achieve high fault tol...
ESA
1999
Springer
13 years 12 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...