{"title":"SplineGen:用于无组织点 B 样条逼近的生成模型","authors":"Qiang Zou, Lizhen Zhu","doi":"arxiv-2406.09692","DOIUrl":null,"url":null,"abstract":"This paper presents a learning-based method to solve the traditional\nparameterization and knot placement problems in B-spline approximation.\nDifferent from conventional heuristic methods or recent AI-based methods, the\nproposed method does not assume ordered or fixed-size data points as input.\nThere is also no need for manually setting the number of knots. It casts the\nparameterization and knot placement problems as a sequence-to-sequence\ntranslation problem, a generative process automatically determining the number\nof knots, their placement, parameter values, and their ordering. Once trained,\nSplineGen demonstrates a notable improvement over existing methods, with a one\nto two orders of magnitude increase in approximation accuracy on test data.","PeriodicalId":501570,"journal":{"name":"arXiv - CS - Computational Geometry","volume":"40 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SplineGen: a generative model for B-spline approximation of unorganized points\",\"authors\":\"Qiang Zou, Lizhen Zhu\",\"doi\":\"arxiv-2406.09692\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a learning-based method to solve the traditional\\nparameterization and knot placement problems in B-spline approximation.\\nDifferent from conventional heuristic methods or recent AI-based methods, the\\nproposed method does not assume ordered or fixed-size data points as input.\\nThere is also no need for manually setting the number of knots. It casts the\\nparameterization and knot placement problems as a sequence-to-sequence\\ntranslation problem, a generative process automatically determining the number\\nof knots, their placement, parameter values, and their ordering. Once trained,\\nSplineGen demonstrates a notable improvement over existing methods, with a one\\nto two orders of magnitude increase in approximation accuracy on test data.\",\"PeriodicalId\":501570,\"journal\":{\"name\":\"arXiv - CS - Computational Geometry\",\"volume\":\"40 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-14\",\"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.09692\",\"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.09692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
SplineGen: a generative model for B-spline approximation of unorganized points
This paper presents a learning-based method to solve the traditional
parameterization and knot placement problems in B-spline approximation.
Different from conventional heuristic methods or recent AI-based methods, the
proposed method does not assume ordered or fixed-size data points as input.
There is also no need for manually setting the number of knots. It casts the
parameterization and knot placement problems as a sequence-to-sequence
translation problem, a generative process automatically determining the number
of knots, their placement, parameter values, and their ordering. Once trained,
SplineGen demonstrates a notable improvement over existing methods, with a one
to two orders of magnitude increase in approximation accuracy on test data.