Improved Bounds for Wireless Localization

DOI10.1007/978-3-540-69903-3_9zbMath1155.68549OpenAlexW1854814558MaRDI QIDQ3512449

No author found.

Publication date: 15 July 2008

Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/28772

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Coverage with \(k\)-transmitters in the presence of obstacles ⋮ Modem illumination of monotone polygons ⋮ Solving the natural wireless localization problem to optimality efficiently

Cites Work

• Unnamed Item
• Unnamed Item
• Guarding curvilinear art galleries with vertex or point guards
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• A short proof of Chvatal's Watchman Theorem
• An efficient algorithm for finding the CSG representation of a simple polygon
• A combinatorial theorem in plane geometry
• Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
• Maximizing the guarded boundary of an Art Gallery is APX-complete
• Traditional Galleries Require Fewer Watchmen
• Guard placement for efficient point-in-polygon proofs
• Computational complexity of art gallery problems
• Proofs from THE BOOK

This page was built for publication: Improved Bounds for Wireless Localization