A subdivision algorithm for computing the minimum distance between a point and an algebraic curve(点到代数曲线最短距离的细分算法)
距离计算在计算机辅助几何设计与图形学领域有着广泛的应用.为了有效计算点到代数曲线的最短距离，提出了一种基于区间算术和区域细分的细分算法.利用四叉树数据结构对给定区域进行细分，用区间算术计算细分后所有像素点到给定点的距离区间，得到最小距离区间.该方法的优势在于在得到任意精度的点到代数曲线最短距离的同时，亦得到了该结果的最大误差限.为进一步提高速度，还对算法进行了改进....
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Zhejiang University Press
2016-05-01
|
| Series: | Zhejiang Daxue xuebao. Lixue ban |
| Subjects: | |
| Online Access: | https://doi.org/10.3785/j.issn.1008-9497.2016.03.006 |
| _version_ | 1797235873897512960 |
|---|---|
| author | QIJiadai(祁佳玳) SHOUHuahao(寿华好) |
| author_facet | QIJiadai(祁佳玳) SHOUHuahao(寿华好) |
| author_sort | QIJiadai(祁佳玳) |
| collection | DOAJ |
| description | 距离计算在计算机辅助几何设计与图形学领域有着广泛的应用.为了有效计算点到代数曲线的最短距离，提出了一种基于区间算术和区域细分的细分算法.利用四叉树数据结构对给定区域进行细分，用区间算术计算细分后所有像素点到给定点的距离区间，得到最小距离区间.该方法的优势在于在得到任意精度的点到代数曲线最短距离的同时，亦得到了该结果的最大误差限.为进一步提高速度，还对算法进行了改进. |
| first_indexed | 2024-04-24T16:54:53Z |
| format | Article |
| id | doaj.art-1491de2c6c0d406484a6ac16e0a502b1 |
| institution | Directory Open Access Journal |
| issn | 1008-9497 |
| language | zho |
| last_indexed | 2024-04-24T16:54:53Z |
| publishDate | 2016-05-01 |
| publisher | Zhejiang University Press |
| record_format | Article |
| series | Zhejiang Daxue xuebao. Lixue ban |
| spelling | doaj.art-1491de2c6c0d406484a6ac16e0a502b12024-03-29T01:58:35ZzhoZhejiang University PressZhejiang Daxue xuebao. Lixue ban1008-94972016-05-0143328629110.3785/j.issn.1008-9497.2016.03.006A subdivision algorithm for computing the minimum distance between a point and an algebraic curve(点到代数曲线最短距离的细分算法)QIJiadai(祁佳玳)0https://orcid.org/0000-0003-4909-854XSHOUHuahao(寿华好)1https://orcid.org/0000-0002-8991-337XCollege of Science, Zhejiang University of Technology, Hangzhou 310023, China(浙江工业大学理学院，浙江 杭州 310023)College of Science, Zhejiang University of Technology, Hangzhou 310023, China(浙江工业大学理学院，浙江 杭州 310023)距离计算在计算机辅助几何设计与图形学领域有着广泛的应用.为了有效计算点到代数曲线的最短距离，提出了一种基于区间算术和区域细分的细分算法.利用四叉树数据结构对给定区域进行细分，用区间算术计算细分后所有像素点到给定点的距离区间，得到最小距离区间.该方法的优势在于在得到任意精度的点到代数曲线最短距离的同时，亦得到了该结果的最大误差限.为进一步提高速度，还对算法进行了改进.https://doi.org/10.3785/j.issn.1008-9497.2016.03.006代数曲线最短距离区间算术细分算法 |
| spellingShingle | QIJiadai(祁佳玳) SHOUHuahao(寿华好) A subdivision algorithm for computing the minimum distance between a point and an algebraic curve(点到代数曲线最短距离的细分算法) Zhejiang Daxue xuebao. Lixue ban 代数曲线 最短距离 区间算术 细分算法 |
| title | A subdivision algorithm for computing the minimum distance between a point and an algebraic curve(点到代数曲线最短距离的细分算法) |
| title_full | A subdivision algorithm for computing the minimum distance between a point and an algebraic curve(点到代数曲线最短距离的细分算法) |
| title_fullStr | A subdivision algorithm for computing the minimum distance between a point and an algebraic curve(点到代数曲线最短距离的细分算法) |
| title_full_unstemmed | A subdivision algorithm for computing the minimum distance between a point and an algebraic curve(点到代数曲线最短距离的细分算法) |
| title_short | A subdivision algorithm for computing the minimum distance between a point and an algebraic curve(点到代数曲线最短距离的细分算法) |
| title_sort | subdivision algorithm for computing the minimum distance between a point and an algebraic curve 点到代数曲线最短距离的细分算法 |
| topic | 代数曲线 最短距离 区间算术 细分算法 |
| url | https://doi.org/10.3785/j.issn.1008-9497.2016.03.006 |
| work_keys_str_mv | AT qijiadaiqíjiādài asubdivisionalgorithmforcomputingtheminimumdistancebetweenapointandanalgebraiccurvediǎndàodàishùqūxiànzuìduǎnjùlídexìfēnsuànfǎ AT shouhuahaoshòuhuáhǎo asubdivisionalgorithmforcomputingtheminimumdistancebetweenapointandanalgebraiccurvediǎndàodàishùqūxiànzuìduǎnjùlídexìfēnsuànfǎ AT qijiadaiqíjiādài subdivisionalgorithmforcomputingtheminimumdistancebetweenapointandanalgebraiccurvediǎndàodàishùqūxiànzuìduǎnjùlídexìfēnsuànfǎ AT shouhuahaoshòuhuáhǎo subdivisionalgorithmforcomputingtheminimumdistancebetweenapointandanalgebraiccurvediǎndàodàishùqūxiànzuìduǎnjùlídexìfēnsuànfǎ |