最短路径和网络

Handbook of Discrete and Computational Geometry, 2nd Ed. Pub Date : 1900-01-01 DOI:10.1201/9781420035315.ch27

Joseph S. B. Mitchell

{"title":"最短路径和网络","authors":"Joseph S. B. Mitchell","doi":"10.1201/9781420035315.ch27","DOIUrl":null,"url":null,"abstract":"We survey various forms of the problem, primarily in two and three dimensions, for motion of a single point, since most results have focused on these cases. We discuss shortest paths in a simple polygon (Section 31.1), shortest paths among obstacles (Section 31.2), and other metrics for length (Section 31.3). We also survey other related geometric network optimization problems (Section 31.4). Higher dimensions are discussed in Section 31.5.","PeriodicalId":156768,"journal":{"name":"Handbook of Discrete and Computational Geometry, 2nd Ed.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"145","resultStr":"{\"title\":\"Shortest Paths and Networks\",\"authors\":\"Joseph S. B. Mitchell\",\"doi\":\"10.1201/9781420035315.ch27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We survey various forms of the problem, primarily in two and three dimensions, for motion of a single point, since most results have focused on these cases. We discuss shortest paths in a simple polygon (Section 31.1), shortest paths among obstacles (Section 31.2), and other metrics for length (Section 31.3). We also survey other related geometric network optimization problems (Section 31.4). Higher dimensions are discussed in Section 31.5.\",\"PeriodicalId\":156768,\"journal\":{\"name\":\"Handbook of Discrete and Computational Geometry, 2nd Ed.\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"145\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Handbook of Discrete and Computational Geometry, 2nd Ed.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1201/9781420035315.ch27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Handbook of Discrete and Computational Geometry, 2nd Ed.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/9781420035315.ch27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 145

摘要

我们调查了问题的各种形式，主要是在二维和三维空间，对于单点的运动，因为大多数结果都集中在这些情况下。我们将讨论简单多边形中的最短路径(第31.1节)，障碍物之间的最短路径(第31.2节)以及其他长度度量(第31.3节)。我们还研究了其他相关的几何网络优化问题(第31.4节)。更高的维度将在第31.5节中讨论。

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

查看原文本刊更多论文

Shortest Paths and Networks

We survey various forms of the problem, primarily in two and three dimensions, for motion of a single point, since most results have focused on these cases. We discuss shortest paths in a simple polygon (Section 31.1), shortest paths among obstacles (Section 31.2), and other metrics for length (Section 31.3). We also survey other related geometric network optimization problems (Section 31.4). Higher dimensions are discussed in Section 31.5.

求助全文

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

来源期刊

Handbook of Discrete and Computational Geometry, 2nd Ed.

自引率

0.00%

发文量