256 search results - page 7 / 52 » Short trees in polygons |
COCOON
2001
Springer
14 years 1 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...
WALCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
DCG
1999
13 years 8 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...