一种计算两个凸多边形间平移包容可行区域的有效方法

Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI:10.1109/CDCS.2001.918735

Yu-Kumg Chen, S. Chou, Tzong-Chen Wu

{"title":"一种计算两个凸多边形间平移包容可行区域的有效方法","authors":"Yu-Kumg Chen, S. Chou, Tzong-Chen Wu","doi":"10.1109/CDCS.2001.918735","DOIUrl":null,"url":null,"abstract":"A convex polygon containment problem is studied: whether a given convex polygon P can be translated to fit inside another fixed convex polygon Q. An O(pq log q) time algorithm is presented for solving such a problem, where p and q are the numbers of vertices of P and Q. In addition, by utilizing the existence algorithm, it takes O(pq log q) time to find the set of all placements of P that fit inside Q.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An efficient method for computing the feasible region with translational containment between two convex polygons\",\"authors\":\"Yu-Kumg Chen, S. Chou, Tzong-Chen Wu\",\"doi\":\"10.1109/CDCS.2001.918735\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A convex polygon containment problem is studied: whether a given convex polygon P can be translated to fit inside another fixed convex polygon Q. An O(pq log q) time algorithm is presented for solving such a problem, where p and q are the numbers of vertices of P and Q. In addition, by utilizing the existence algorithm, it takes O(pq log q) time to find the set of all placements of P that fit inside Q.\",\"PeriodicalId\":273489,\"journal\":{\"name\":\"Proceedings 21st International Conference on Distributed Computing Systems Workshops\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 21st International Conference on Distributed Computing Systems Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDCS.2001.918735\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDCS.2001.918735","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

研究了一个凸多边形包容问题:给定的凸多边形P能否平移到另一个固定的凸多边形q内。给出了求解该问题的O(pq log q)时间算法，其中P和q分别为P和q的顶点数。此外，利用存在性算法，用O(pq log q)时间找到适合于q内的P的所有位置的集合。

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

查看原文本刊更多论文

An efficient method for computing the feasible region with translational containment between two convex polygons

A convex polygon containment problem is studied: whether a given convex polygon P can be translated to fit inside another fixed convex polygon Q. An O(pq log q) time algorithm is presented for solving such a problem, where p and q are the numbers of vertices of P and Q. In addition, by utilizing the existence algorithm, it takes O(pq log q) time to find the set of all placements of P that fit inside Q.

求助全文

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

来源期刊

Proceedings 21st International Conference on Distributed Computing Systems Workshops

自引率

0.00%

发文量