Algorithms for computing best coverage path in the presence of obstacles in a sensor field

DOI10.1016/j.jda.2012.01.004zbMath1247.68012OpenAlexW1986938448MaRDI QIDQ450535

Sajal K. Das, Senjuti Basu Roy, Gautam K. Das

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.01.004

zbMATH Keywords

Voronoi diagramvisibility graphspannersensor networkcoverage problem

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Distributed systems (68M14) Approximation algorithms (68W25)

Related Items (1)

Efficient algorithms for support path with time constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Voronoi diagrams with barriers and the shortest diagonal problem
• Finding constrained and weighted Voronoi diagrams in the plane
• Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
• An Output-Sensitive Algorithm for Computing Visibility Graphs

This page was built for publication: Algorithms for computing best coverage path in the presence of obstacles in a sensor field