885 search results - page 37 / 177 » Optimal Polygon Placement |
SAC
2008
ACM
13 years 9 months ago
2008
ACM
FOCS
2000
IEEE
14 years 2 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
CGF
2008
13 years 10 months ago
2008
We present a technique for steganography in polygonal meshes. Our method hides a message in the indexed representation of a mesh by permuting the order in which faces and vertices...
COCOON
2001
Springer
14 years 2 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...