Extremal problems on ray sensor configurations

DOI10.1016/J.DAM.2023.01.005MaRDI QIDQ2696617zbMATH OpenOpenAlexFDO

Authors Kirk Boyer, Mario A. Lopez, Paul Horn

Publication date 17 April 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2023.01.005

zbMATH Keywords

extremal problemssensor networksbarrier graphs

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)

Recommendations

• scientific article; zbMATH DE number 6258454
• Extremal problems for ray systems with a variable number of points on rays
• On the barrier graph of an arrangement of ray sensors
• A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
• Optimal design of sensors via geometric criteria
• Configurations of non-crossing rays and related problems
• On an optimization problem in sensor selection
• scientific article; zbMATH DE number 5925331
• On the problem of sensor placement

Cites work

• A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
• Minimum Cell Connection in Line Segment Arrangements
• On the barrier graph of an arrangement of ray sensors

Cited in

(2)

• scientific article; zbMATH DE number 6258454 (Why is no real title available?)
• Sensitivity of ray paths to initial conditions

This page was built for publication: Extremal problems on ray sensor configurations

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