斐洛最短线段问题的对偶问题

arXiv - CS - Computational Geometry Pub Date : 2024-06-09 DOI:arxiv-2406.05702

Yagub N. Aliyev

{"title":"斐洛最短线段问题的对偶问题","authors":"Yagub N. Aliyev","doi":"arxiv-2406.05702","DOIUrl":null,"url":null,"abstract":"We study the dual of Philo's shortest line segment problem which asks to find\nthe optimal line segments passing through two given points, with a common\nendpoint, and with the other endpoints on a given line. The provided solution\nuses multivariable calculus and geometry methods. Interesting connections with\nthe angle bisector of the triangle are explored.","PeriodicalId":501570,"journal":{"name":"arXiv - CS - Computational Geometry","volume":"191 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The dual of Philo's shortest line segment problem\",\"authors\":\"Yagub N. Aliyev\",\"doi\":\"arxiv-2406.05702\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the dual of Philo's shortest line segment problem which asks to find\\nthe optimal line segments passing through two given points, with a common\\nendpoint, and with the other endpoints on a given line. The provided solution\\nuses multivariable calculus and geometry methods. Interesting connections with\\nthe angle bisector of the triangle are explored.\",\"PeriodicalId\":501570,\"journal\":{\"name\":\"arXiv - CS - Computational Geometry\",\"volume\":\"191 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Computational Geometry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.05702\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.05702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们研究了菲洛最短线段问题的对偶问题，该问题要求找到经过两个给定点的最优线段，它们有一个公共端点，而另一个端点在一条给定的直线上。所提供的解决方案使用了多元微积分和几何方法。探索了三角形角平分线的有趣联系。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The dual of Philo's shortest line segment problem

We study the dual of Philo's shortest line segment problem which asks to find the optimal line segments passing through two given points, with a common endpoint, and with the other endpoints on a given line. The provided solution uses multivariable calculus and geometry methods. Interesting connections with the angle bisector of the triangle are explored.

求助全文

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

来源期刊

arXiv - CS - Computational Geometry

自引率

0.00%

发文量

期刊最新文献

Minimum Plane Bichromatic Spanning Trees Evolving Distributions Under Local Motion New Lower Bound and Algorithms for Online Geometric Hitting Set Problem Computing shortest paths amid non-overlapping weighted disks Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing