Improved Bounds for Wireless Localization

We consider a novel class of art gallery problems inspired by wireless localization that has recently been introduced by Eppstein, Goodrich, and Sitchinava. Given a simple polygon P , place and orient guards each of which broadcasts a unique key within a fixed angular range. In contrast to the clas...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 57; no. 3; pp. 499 - 516
Main Authors:	Christ, Tobias, Hoffmann, Michael, Okamoto, Yoshio, Uno, Takeaki
Format:	Journal Article Conference Proceeding
Language:	English
Published:	New York Springer-Verlag 01.07.2010 Springer
Subjects:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer systems and distributed systems. User interface Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Logical, boolean and switching functions Mathematics of Computing Software Theoretical computing Theory of Computation Computational geometry Art gallery problems Lower bound Upper bound Boolean logic Wireless network Localization Polygon Art gallery
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!