Improved bounds for wireless localization

DOI10.1007/S00453-009-9287-2MaRDI QIDQ970612zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

Publication date 19 May 2010

Published in Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

art gallery problemscomputational geometry

Mathematics Subject Classification ID

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

Recommendations

• Improved Bounds for Wireless Localization
• Solving the natural wireless localization problem to optimality efficiently
• Adaptive localization in wireless networks
• An Effective Area-Based Localization Algorithm for Wireless Networks
• Improving the accuracy of cell-based positioning for wireless networks
• Localization in Wireless Networks

Cites work

• A combinatorial theorem in plane geometry
• A short proof of Chvatal's Watchman Theorem
• Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
• An efficient algorithm for finding the CSG representation of a simple polygon
• COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
• Computational complexity of art gallery problems
• Guard placement for efficient point-in-polygon proofs
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• Maximizing the guarded boundary of an Art Gallery is APX-complete
• Traditional Galleries Require Fewer Watchmen

Cited in

(5)

• Optimal art gallery localization is NP-hard
• Solving the natural wireless localization problem to optimality efficiently
• A hybrid metaheuristic strategy for covering with wireless devices
• Improved Bounds for Wireless Localization
• Algorithms for subpath convex hull queries and ray-shooting among segments

This page was built for publication: Improved bounds for wireless localization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970612)