A fast algorithm for data collection along a fixed track

DOI10.1016/j.tcs.2013.11.037zbMath1360.68870OpenAlexW2004260769MaRDI QIDQ744105

Joachim Gudmundsson, Otfried Schwarzkopf, Radwa El Shawi

Publication date: 6 October 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.037

zbMATH Keywords

computational geometrywireless sensor networksabstract Voronoi diagram

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Abstract Voronoi Diagrams from Closed Bisecting Curves

Cites Work

• Unnamed Item
• Randomized incremental construction of abstract Voronoi diagrams
• On the construction of abstract Voronoi diagrams
• Abstract Voronoi diagrams revisited
• Concrete and abstract Voronoi diagrams
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Offline Algorithms for Dynamic Minimum Spanning Tree Problems
• FURTHEST SITE ABSTRACT VORONOI DIAGRAMS

This page was built for publication: A fast algorithm for data collection along a fixed track