覆盖1.5D地形由共同高度塔

2018 26th International Conference on Systems Engineering (ICSEng) Pub Date : 2018-12-01 DOI:10.1109/ICSENG.2018.8638174

L. Gewali, Binay Dahal

{"title":"覆盖1.5D地形由共同高度塔","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":"{\"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}","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

摘要

找到覆盖1.5维地形的最小塔数是一个棘手的问题。我们提出了一种易于实现的近似算法，用于用给定公共高度的塔覆盖1.5D地形。我们描述了一种识别可以安装塔基的潜在输入点的技术。我们展示了如何计算这些放置点的一个小子集，以便放置在这些点上的塔可以覆盖整个地形。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Covering 1.5D Terrain by Common Height Towers

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 26th International Conference on Systems Engineering (ICSEng)

自引率

0.00%

发文量