您当前所在位置: 首页 > 学者

雍俊海

  • 26浏览

  • 0点赞

  • 0收藏

  • 0分享

  • 85下载

  • 0评论

  • 引用

期刊论文

A new algorithm for Boolean operations on general polygons

雍俊海Yu Peng a Jun-Hai Yong b Wei-Ming Dong a Hui Zhang b Jia-Guang Sun ab

Computers & Graphics 29 (2005) 57-70,-0001,():

URL:

摘要/描述

A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edges of the two general polygons are subdivided at the intersection points and touching points. Thus, the boundaryof the Boolean operation resultant polygon is made of some whole edges of the polygons after the subdivision process. We use the simplex theory to build the basic mathematical model of the new algorithm. The subordination problem between an edge and a polygon is reduced to a problem of determining whether a point is on some edges of some simplices or inside the simplices, and the associated simplicial chain of the resultant polygon is just an assembly of some simplices and their coefficients of the two polygons after the subdivision process. Examples show that the running time required bythe new algorithm is less than one-third of that bythe Rivero and Feito algorithm.

版权说明:以下全部内容由雍俊海上传于   2005年06月29日 00时18分23秒,版权归本人所有。

我要评论

全部评论 0

本学者其他成果

    同领域成果