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

DOI10.1016/J.IPL.2009.03.016zbMATH Open1213.68646OpenAlexW2046910716MaRDI QIDQ989482FDOQ989482

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

computational geometrycoveringVoronoi diagramsgeometric optimisationminimum rangesafe routes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Covering a line segment with variable radius discs
• Backtrack Programming
• Geometric complexity of some location problems

Cited In (2)

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• Homogeneous 2-hop broadcast in 2D 👍 👎
• Coverage restricted to an angle 👍 👎
• Minimum-cost coverage of point sets by disks 👍 👎
• Power consumption in packet radio networks 👍 👎

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

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