{"title":"计算距离函数","authors":"Rémi Abgrall","doi":"10.5802/crmeca.155","DOIUrl":null,"url":null,"abstract":"Computing the distance function to some surface or line is a problem that occurs very frequently. There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation of Hamilton Jacobi problems, or the fast sweeping method. Here we make a link with some elliptic problem and propose a very fast way to approximate the distance function.","PeriodicalId":10566,"journal":{"name":"Comptes Rendus. Chimie","volume":"27 1","pages":"0"},"PeriodicalIF":1.2000,"publicationDate":"2023-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Evaluating a distance function\",\"authors\":\"Rémi Abgrall\",\"doi\":\"10.5802/crmeca.155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Computing the distance function to some surface or line is a problem that occurs very frequently. There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation of Hamilton Jacobi problems, or the fast sweeping method. Here we make a link with some elliptic problem and propose a very fast way to approximate the distance function.\",\"PeriodicalId\":10566,\"journal\":{\"name\":\"Comptes Rendus. Chimie\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2023-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Comptes Rendus. Chimie\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5802/crmeca.155\",\"RegionNum\":4,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Comptes Rendus. Chimie","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5802/crmeca.155","RegionNum":4,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
Computing the distance function to some surface or line is a problem that occurs very frequently. There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation of Hamilton Jacobi problems, or the fast sweeping method. Here we make a link with some elliptic problem and propose a very fast way to approximate the distance function.
期刊介绍:
The Comptes Rendus - Chimie are a free-of-charge, open access and peer-reviewed electronic scientific journal publishing original research articles. It is one of seven journals published by the Académie des sciences.
Its objective is to enable researchers to quickly share their work with the international scientific community.
The Comptes Rendus - Chimie also publish journal articles, thematic issues and articles reflecting the history of the Académie des sciences and its current scientific activity.