Improved bounds for wireless localization
From MaRDI portal
Publication:970612
DOI10.1007/s00453-009-9287-2zbMath1201.68137MaRDI QIDQ970612
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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
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