An efficient algorithm for polygon clipping based on intersection points sorting(一种基于交点排序的高效多边形裁剪算法)
提出了一种适合任意多边形裁剪的算法，该算法将构成结果多边形的裁剪多边形和实体多边形顶点插入到两者的交点链表中，通过交点位置的排序，形成一个单线性、单指针结构的结果多边形顶点链表.简化了交点的数据结构，减少了裁剪多边形与实体多边形边界的循环求交次数.最后，通过与其他同类算法进行比较，验证了算法运行的效率优势....
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Zhejiang University Press
2012-01-01
|
| Series: | Zhejiang Daxue xuebao. Lixue ban |
| Subjects: | |
| Online Access: | https://doi.org/10.3785/j.issn.1008-9497.2012.01.022 |
| _version_ | 1827303214257537024 |
|---|---|
| author | PENGJie(彭杰) LIUNan(刘南) TANGYuan-bin(唐远彬) DUZhen-hong(杜震洪) LIURen-yi(刘仁义) |
| author_facet | PENGJie(彭杰) LIUNan(刘南) TANGYuan-bin(唐远彬) DUZhen-hong(杜震洪) LIURen-yi(刘仁义) |
| author_sort | PENGJie(彭杰) |
| collection | DOAJ |
| description | 提出了一种适合任意多边形裁剪的算法，该算法将构成结果多边形的裁剪多边形和实体多边形顶点插入到两者的交点链表中，通过交点位置的排序，形成一个单线性、单指针结构的结果多边形顶点链表.简化了交点的数据结构，减少了裁剪多边形与实体多边形边界的循环求交次数.最后，通过与其他同类算法进行比较，验证了算法运行的效率优势. |
| first_indexed | 2024-04-24T16:58:01Z |
| format | Article |
| id | doaj.art-cac615c63fdf4a2ca7d7776ecdc0d743 |
| institution | Directory Open Access Journal |
| issn | 1008-9497 |
| language | zho |
| last_indexed | 2024-04-24T16:58:01Z |
| publishDate | 2012-01-01 |
| publisher | Zhejiang University Press |
| record_format | Article |
| series | Zhejiang Daxue xuebao. Lixue ban |
| spelling | doaj.art-cac615c63fdf4a2ca7d7776ecdc0d7432024-03-29T01:58:30ZzhoZhejiang University PressZhejiang Daxue xuebao. Lixue ban1008-94972012-01-0139110711110.3785/j.issn.1008-9497.2012.01.022An efficient algorithm for polygon clipping based on intersection points sorting(一种基于交点排序的高效多边形裁剪算法)PENGJie(彭杰)0LIUNan(刘南)1TANGYuan-bin(唐远彬)2DUZhen-hong(杜震洪)3LIURen-yi(刘仁义)4 1.Zhejiang Provincial Key Lab of GIS, Zhejiang University, Hangzhou 310028, China( 1.浙江大学浙江省资源与环境重点实验室，浙江 杭州 310028) 1.Zhejiang Provincial Key Lab of GIS, Zhejiang University, Hangzhou 310028, China( 1.浙江大学浙江省资源与环境重点实验室，浙江 杭州 310028) 1.Zhejiang Provincial Key Lab of GIS, Zhejiang University, Hangzhou 310028, China( 1.浙江大学浙江省资源与环境重点实验室，浙江 杭州 310028) 1.Zhejiang Provincial Key Lab of GIS, Zhejiang University, Hangzhou 310028, China( 1.浙江大学浙江省资源与环境重点实验室，浙江 杭州 310028) 2.Insistute of Geographic In formation Science, Zhejiang University, Hangzhou 310028, China( 2.浙江大学地理信息科学研究所，浙江 杭州 310028)提出了一种适合任意多边形裁剪的算法，该算法将构成结果多边形的裁剪多边形和实体多边形顶点插入到两者的交点链表中，通过交点位置的排序，形成一个单线性、单指针结构的结果多边形顶点链表.简化了交点的数据结构，减少了裁剪多边形与实体多边形边界的循环求交次数.最后，通过与其他同类算法进行比较，验证了算法运行的效率优势.https://doi.org/10.3785/j.issn.1008-9497.2012.01.022多边形裁剪交点计算交点排序 |
| spellingShingle | PENGJie(彭杰) LIUNan(刘南) TANGYuan-bin(唐远彬) DUZhen-hong(杜震洪) LIURen-yi(刘仁义) An efficient algorithm for polygon clipping based on intersection points sorting(一种基于交点排序的高效多边形裁剪算法) Zhejiang Daxue xuebao. Lixue ban 多边形裁剪 交点计算 交点排序 |
| title | An efficient algorithm for polygon clipping based on intersection points sorting(一种基于交点排序的高效多边形裁剪算法) |
| title_full | An efficient algorithm for polygon clipping based on intersection points sorting(一种基于交点排序的高效多边形裁剪算法) |
| title_fullStr | An efficient algorithm for polygon clipping based on intersection points sorting(一种基于交点排序的高效多边形裁剪算法) |
| title_full_unstemmed | An efficient algorithm for polygon clipping based on intersection points sorting(一种基于交点排序的高效多边形裁剪算法) |
| title_short | An efficient algorithm for polygon clipping based on intersection points sorting(一种基于交点排序的高效多边形裁剪算法) |
| title_sort | efficient algorithm for polygon clipping based on intersection points sorting 一种基于交点排序的高效多边形裁剪算法 |
| topic | 多边形裁剪 交点计算 交点排序 |
| url | https://doi.org/10.3785/j.issn.1008-9497.2012.01.022 |
| work_keys_str_mv | AT pengjiepéngjié anefficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ AT liunanliúnán anefficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ AT tangyuanbintángyuǎnbīn anefficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ AT duzhenhongdùzhènhóng anefficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ AT liurenyiliúrényì anefficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ AT pengjiepéngjié efficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ AT liunanliúnán efficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ AT tangyuanbintángyuǎnbīn efficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ AT duzhenhongdùzhènhóng efficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ AT liurenyiliúrényì efficientalgorithmforpolygonclippingbasedonintersectionpointssortingyīzhǒngjīyújiāodiǎnpáixùdegāoxiàoduōbiānxíngcáijiǎnsuànfǎ |