676 search results - page 59 / 136 » A Search-Free Intersection Algorithm |
112
Voted
COCOON
2001
Springer
15 years 6 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
101
click to vote
ICIAP
2007
ACM
15 years 6 months ago
2007
ACM
We describe a new decomposition algorithm for twodimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by group...
115
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
159
click to vote
IPL
2007
15 years 2 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
118
click to vote
AAECC
2002
Springer
15 years 2 months ago
2002
Springer
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...