Hannah Potgieter, Razvan C. Fetecau, Steven J. Ruuth
{"title":"用表面有限元法求测地线距离近似的p-拉普拉斯","authors":"Hannah Potgieter, Razvan C. Fetecau, Steven J. Ruuth","doi":"10.1016/j.cagd.2025.102458","DOIUrl":null,"url":null,"abstract":"<div><div>We use the <em>p</em>-Laplacian with large <em>p</em>-values in order to approximate geodesic distances to features on surfaces. This differs from Fayolle and Belyaev's (<span><span>2018</span></span>) computational results using the <em>p</em>-Laplacian for the <em>distance-to-surface</em> problem. Our approach appears to offer some distinct advantages over other popular PDE-based distance function approximation methods. We employ a surface finite element scheme and demonstrate numerical convergence to the true geodesic distance functions. We check that our numerical results adhere to the triangle inequality and examine robustness against geometric noise such as vertex perturbations. We also present comparisons of our method with the heat method from <span><span>Crane et al. (2017)</span></span> and the classical polyhedral method from <span><span>Mitchell et al. (1987)</span></span>.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"120 ","pages":"Article 102458"},"PeriodicalIF":1.3000,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Geodesic distance approximation using a surface finite element method for the p-Laplacian\",\"authors\":\"Hannah Potgieter, Razvan C. Fetecau, Steven J. Ruuth\",\"doi\":\"10.1016/j.cagd.2025.102458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We use the <em>p</em>-Laplacian with large <em>p</em>-values in order to approximate geodesic distances to features on surfaces. This differs from Fayolle and Belyaev's (<span><span>2018</span></span>) computational results using the <em>p</em>-Laplacian for the <em>distance-to-surface</em> problem. Our approach appears to offer some distinct advantages over other popular PDE-based distance function approximation methods. We employ a surface finite element scheme and demonstrate numerical convergence to the true geodesic distance functions. We check that our numerical results adhere to the triangle inequality and examine robustness against geometric noise such as vertex perturbations. We also present comparisons of our method with the heat method from <span><span>Crane et al. (2017)</span></span> and the classical polyhedral method from <span><span>Mitchell et al. (1987)</span></span>.</div></div>\",\"PeriodicalId\":55226,\"journal\":{\"name\":\"Computer Aided Geometric Design\",\"volume\":\"120 \",\"pages\":\"Article 102458\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2025-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Aided Geometric Design\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167839625000470\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839625000470","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Geodesic distance approximation using a surface finite element method for the p-Laplacian
We use the p-Laplacian with large p-values in order to approximate geodesic distances to features on surfaces. This differs from Fayolle and Belyaev's (2018) computational results using the p-Laplacian for the distance-to-surface problem. Our approach appears to offer some distinct advantages over other popular PDE-based distance function approximation methods. We employ a surface finite element scheme and demonstrate numerical convergence to the true geodesic distance functions. We check that our numerical results adhere to the triangle inequality and examine robustness against geometric noise such as vertex perturbations. We also present comparisons of our method with the heat method from Crane et al. (2017) and the classical polyhedral method from Mitchell et al. (1987).
期刊介绍:
The journal Computer Aided Geometric Design is for researchers, scholars, and software developers dealing with mathematical and computational methods for the description of geometric objects as they arise in areas ranging from CAD/CAM to robotics and scientific visualization. The journal publishes original research papers, survey papers and with quick editorial decisions short communications of at most 3 pages. The primary objects of interest are curves, surfaces, and volumes such as splines (NURBS), meshes, subdivision surfaces as well as algorithms to generate, analyze, and manipulate them. This journal will report on new developments in CAGD and its applications, including but not restricted to the following:
-Mathematical and Geometric Foundations-
Curve, Surface, and Volume generation-
CAGD applications in Numerical Analysis, Computational Geometry, Computer Graphics, or Computer Vision-
Industrial, medical, and scientific applications.
The aim is to collect and disseminate information on computer aided design in one journal. To provide the user community with methods and algorithms for representing curves and surfaces. To illustrate computer aided geometric design by means of interesting applications. To combine curve and surface methods with computer graphics. To explain scientific phenomena by means of computer graphics. To concentrate on the interaction between theory and application. To expose unsolved problems of the practice. To develop new methods in computer aided geometry.