132
click to vote
JCDCG
2000
Springer
15 years 9 months ago
2000
Springer
A k-dissection D of a polygon P, is a partition of P into a set of subpolygons {Q1, . . . , Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, ....
128
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
127
click to vote
ISCAS
1993
IEEE
15 years 10 months ago
1993
IEEE
Abstract—The range of operating conditions for a seriesparallelnetworkofvariablelinearresistors, voltagesources, and current sources can be represented as a convex polygon in a T...
196
click to vote
ISAAC
2009
Springer
16 years 15 days ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
188
click to vote
FOCS
2009
IEEE
16 years 21 days ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...