Jin Zhao , Pengfei Wang , Shuangmin Chen , Jiong Guo , Shiqing Xin , Changhe Tu , Wenping Wang
{"title":"向着受参数曲面约束的精确曲线偏移","authors":"Jin Zhao , Pengfei Wang , Shuangmin Chen , Jiong Guo , Shiqing Xin , Changhe Tu , Wenping Wang","doi":"10.1016/j.cad.2025.103916","DOIUrl":null,"url":null,"abstract":"<div><div>Computing offsets of curves on parametric surfaces is a fundamental yet challenging operation in computer-aided design and manufacturing. Traditional analytical approaches suffer from time-consuming geodesic distance queries and complex self-intersection handling, while discrete methods often struggle with precision. In this paper, we propose a totally different algorithm paradigm. Our key insight is that by representing the source curve as a sequence of line-segment primitives, the Voronoi decomposition constrained to the parametric surface enables localized offset computation. Specifically, the offsetting process can be efficiently traced by independently visiting the corresponding Voronoi cells. To address the challenge of computing the Voronoi decomposition on parametric surfaces, we introduce two key techniques. First, we employ intrinsic triangulation in the parameter space to accurately capture geodesic distances. Second, instead of directly computing the surface-constrained Voronoi decomposition, we decompose the triangulated parameter plane using a series of plane-cutting operations. Experimental results demonstrate that our algorithm achieves superior accuracy and runtime performance compared to existing methods. We also present several practical applications enabled by our approach.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"188 ","pages":"Article 103916"},"PeriodicalIF":3.1000,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Toward precise curve offsetting constrained to parametric surfaces\",\"authors\":\"Jin Zhao , Pengfei Wang , Shuangmin Chen , Jiong Guo , Shiqing Xin , Changhe Tu , Wenping Wang\",\"doi\":\"10.1016/j.cad.2025.103916\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Computing offsets of curves on parametric surfaces is a fundamental yet challenging operation in computer-aided design and manufacturing. Traditional analytical approaches suffer from time-consuming geodesic distance queries and complex self-intersection handling, while discrete methods often struggle with precision. In this paper, we propose a totally different algorithm paradigm. Our key insight is that by representing the source curve as a sequence of line-segment primitives, the Voronoi decomposition constrained to the parametric surface enables localized offset computation. Specifically, the offsetting process can be efficiently traced by independently visiting the corresponding Voronoi cells. To address the challenge of computing the Voronoi decomposition on parametric surfaces, we introduce two key techniques. First, we employ intrinsic triangulation in the parameter space to accurately capture geodesic distances. Second, instead of directly computing the surface-constrained Voronoi decomposition, we decompose the triangulated parameter plane using a series of plane-cutting operations. Experimental results demonstrate that our algorithm achieves superior accuracy and runtime performance compared to existing methods. We also present several practical applications enabled by our approach.</div></div>\",\"PeriodicalId\":50632,\"journal\":{\"name\":\"Computer-Aided Design\",\"volume\":\"188 \",\"pages\":\"Article 103916\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2025-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer-Aided Design\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0010448525000776\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010448525000776","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Toward precise curve offsetting constrained to parametric surfaces
Computing offsets of curves on parametric surfaces is a fundamental yet challenging operation in computer-aided design and manufacturing. Traditional analytical approaches suffer from time-consuming geodesic distance queries and complex self-intersection handling, while discrete methods often struggle with precision. In this paper, we propose a totally different algorithm paradigm. Our key insight is that by representing the source curve as a sequence of line-segment primitives, the Voronoi decomposition constrained to the parametric surface enables localized offset computation. Specifically, the offsetting process can be efficiently traced by independently visiting the corresponding Voronoi cells. To address the challenge of computing the Voronoi decomposition on parametric surfaces, we introduce two key techniques. First, we employ intrinsic triangulation in the parameter space to accurately capture geodesic distances. Second, instead of directly computing the surface-constrained Voronoi decomposition, we decompose the triangulated parameter plane using a series of plane-cutting operations. Experimental results demonstrate that our algorithm achieves superior accuracy and runtime performance compared to existing methods. We also present several practical applications enabled by our approach.
期刊介绍:
Computer-Aided Design is a leading international journal that provides academia and industry with key papers on research and developments in the application of computers to design.
Computer-Aided Design invites papers reporting new research, as well as novel or particularly significant applications, within a wide range of topics, spanning all stages of design process from concept creation to manufacture and beyond.