Sciweavers

346 search results - page 17 / 70
» Isodiametric Problems for Polygons
Sort
View
IPL
2008
61views more  IPL 2008»
13 years 7 months ago
Online chasing problems for regular polygons
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
WADS
1997
Springer
77views Algorithms» more  WADS 1997»
13 years 11 months ago
Offset-Polygon Annulus Placement Problems
Gill Barequet, Amy J. Briggs, Matthew Dickerson, M...
ISAAC
2004
Springer
79views Algorithms» more  ISAAC 2004»
14 years 23 days ago
Paired Pointset Traversal
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
Peter Hui, Marcus Schaefer
CCCG
2009
13 years 5 months ago
Wireless Localization with Vertex Guards is NP-hard
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
Tobias Christ, Michael Hoffmann
FOCS
2000
IEEE
13 years 11 months ago
Nearly Optimal Expected-Case Planar Point Location
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...
Sunil Arya, Theocharis Malamatos, David M. Mount