138 search results - page 20 / 28 » K-Guarding Polygons on the Plane |
97
Voted
MMM
2003
Springer
15 years 3 months 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...
69
Voted
ISPD
2000
ACM
15 years 2 months 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...
102
Voted
WG
2010
Springer
14 years 8 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...
84
Voted
INFOCOM
2011
IEEE
14 years 1 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...
87
Voted
ESA
1999
Springer
15 years 2 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...