Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Rogue (unauthorized) wireless access points pose serious security threats to local networks. In this paper, we propose two online algorithms to detect rogue access points using se...
Wei Wei, Kyoungwon Suh, Bing Wang, Yu Gu, Jim Kuro...
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...
Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab...
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
The increasing availability of high speed Internet access and the decreasing cost of wireless technologies has increased the number of devices in the home that wirelessly connect ...