2-Covered paths by a set of antennas with minimum power transmission range

DOI10.1016/j.ipl.2009.03.016zbMath1213.68646OpenAlexW2046910716MaRDI QIDQ989482

Inês Matos, Manuel Abellanas, Antonio L. Bajuelos

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.016

zbMATH Keywords

coveringcomputational geometryVoronoi diagramsgeometric optimisationminimum rangesafe routes

Mathematics Subject Classification ID

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

Related Items (2)

Optimal 2-coverage of a polygonal region in a sensor network ⋮ Coverage restricted to an angle

Cites Work

• Unnamed Item
• Covering a line segment with variable radius discs
• Geometric complexity of some location problems
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Backtrack Programming

This page was built for publication: 2-Covered paths by a set of antennas with minimum power transmission range