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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 57; číslo 3; s. 499 - 516
Hlavní autoři:	Christ, Tobias, Hoffmann, Michael, Okamoto, Yoshio, Uno, Takeaki
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.07.2010 Springer
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!