Improved bounds for wireless localization

DOI10.1007/s00453-009-9287-2zbMath1201.68137OpenAlexW4231588467MaRDI QIDQ970612

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

computational geometryart gallery problems

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• 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
• COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
• Traditional Galleries Require Fewer Watchmen
• Guard placement for efficient point-in-polygon proofs
• Computational complexity of art gallery problems

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