{"title":"Covering 1.5D Terrain by Common Height Towers","authors":"L. Gewali, Binay Dahal","doi":"10.1109/ICSENG.2018.8638174","DOIUrl":null,"url":null,"abstract":"Finding the minimum number of towers to cover a 1.5D terrain is an intractable problem. We propose an easily implementable approximation algorithm for covering a 1.5D terrain by towers of given common height. We describe a technique of identifying potential input points where tower bases can be installed. We show how a small subset of these placement points can be computed so that towers placed on such points can cover the entire terrain.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 26th International Conference on Systems Engineering (ICSEng)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSENG.2018.8638174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Finding the minimum number of towers to cover a 1.5D terrain is an intractable problem. We propose an easily implementable approximation algorithm for covering a 1.5D terrain by towers of given common height. We describe a technique of identifying potential input points where tower bases can be installed. We show how a small subset of these placement points can be computed so that towers placed on such points can cover the entire terrain.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
