Algorithms for covering multiple barriers

DOI10.1016/j.tcs.2018.08.004zbMath1411.68171arXiv1704.06870OpenAlexW2950772439MaRDI QIDQ5916077

Shimin Li, Haitao Wang

Publication date: 10 January 2019

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

Full work available at URL: https://arxiv.org/abs/1704.06870

zbMATH Keywords

algorithmsdata structurescomputational geometrymobile sensorsbarrier coveragegeometric coverage

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Algorithms for the line-constrained disk coverage and related problems

Cites Work

• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Minimizing the aggregate movements for interval coverage
• Finding the upper envelope of n line segments in O(n log n) time
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Some dynamic computational geometry problems
• Complexity of barrier coverage with relocatable sensors in the plane
• Optimal point movement for covering circular regions
• Generalized Selection and Ranking: Sorted Matrices
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Minimizing the Maximum Moving Cost of Interval Coverage
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for covering multiple barriers