期刊文献+

一种基于矢量游走的复域多边形合并算法 被引量:1

An Inner Hole Deployed Polygon Combination Algorithm Based on Vector Wander Method
下载PDF
导出
摘要 电磁仿真工具中,常常将许多具有相同属性的多边形合并成一个多边形,以便对图形进行整体操作和网格划分。本文提出了适用于多边形合并的矢量游走规则及交点转移条件,通过交点与相交矢量边的联合处理,简化了重合交点处理,从而实现一种基于矢量游走规则的带内孔复域多边形合并算法。 A number of polygons that shares the same properties are commonly combined into a single polygon so as to facilitate the graphics with overall operations and grid partition.This paper introduces an inner hole deployed polygon combination algorithm based on vector wander method,and proposes the related rules and converge shift conditions.The simplification of coincidence intersection processing is also proposed by combinational handling the intersection and the intersected vector.
出处 《微计算机应用》 2011年第6期1-7,共7页 Microcomputer Applications
关键词 多边形 矢量游走 合并运算 相交 重合顶点 Polygon Vector Wander Combination Algorithm Intersected Coincidence Intersection
  • 相关文献

参考文献5

二级参考文献25

  • 1肖忠晖,卢振荣,张谦.简单多边形凸单元剖分的编码算法[J].计算机学报,1996,19(6):477-480. 被引量:27
  • 2同济大学数学教研室.高等数学[M].北京:高等教育出版社,1995..
  • 3Sutherland I E, Hodgeman G W. Reentran't Polygon Clipping [J]. Communications of the ACM, 1974,17(1):32-42.
  • 4Liang Y, Barsky B A. An Analysis and Algorithm for Polygon Clipping[J]. Communications of the ACM, 1983,26(11):868-877.
  • 5Foley J D, Dam A, Feiner S K, et al. Computer Graphics, Principles and Practice [M]. Reading, M A:Addison-Wesley, 1990.
  • 6Maillot PG. A New, Fast Method for 2D Polygon Clipping: Analysis and Software Implementation[J]. ACM Transactions on Graphics, 1992,11 (3):276-290.
  • 7Andereev R D. Algorithm for Clipping Arbitrary Polygons [J]. Computer Graphics Forum, 1989, 8(2):183-191.
  • 8Weiler K, Atherton P. Hidden Surface Removal Using Polygon Area Sorting[C]. The SIGGRAPH' 77, New York, 1977.
  • 9Vatti B R. A Generic Solution to Polygon Clipping [J]. Communications of theACM, 1992,35(1):56- 63.
  • 10Greiner G, Hormann K. Efficient Clipping of Arbitrary Polygons[J]. ACM Transactions on Graphics, 1998,17(2) :71-83.

共引文献103

同被引文献17

  • 1彭杰,刘南,唐远彬,杜震洪,刘仁义.一种基于交点排序的高效多边形裁剪算法[J].浙江大学学报(理学版),2012,39(1):107-111. 被引量:12
  • 2Goodchild M F.Statistical aspects of the polygon overlay problem[M].Harvard Papers on Geographic Information Systems.Reading,MA,USA:Addison-Wesley Publishing Company,1977:6.
  • 3Environmental Systems Research Institute,Inc.ESRI Shapefile Technical Description[EB/OL].Jul 1998.http://www.esri.com/library/whitepapers/pdfs/shapefile.pdf.
  • 4Sutherland I E,Hodgman G W.Reentrant polygon clipping[J].Communications of the ACM,1974(17):32-42.
  • 5Weiler K,Atherton P.Hidden surface removal using polygon area sorting[J].Computer Graphics,1977,11(2):214-222.
  • 6Vatti B R.A generic solution to polygon clipping[J].Communications of the ACM,1992,35(7):56-63.
  • 7Greiner G,Hormann K.Efficient clipping of arbitrary polygons[J].ACM Transactions on Graphics,1998,17(2):71-83.
  • 8Murta A.A generic polygon clipping library [EB/OL].1998.http://www.cs.man.ac.uk/~toby/alan/software/gpc.html.[2012-11-28].
  • 9Cormen T H,Leiserson C E,Rivest R L,et al.Introduction to algorithms (Second Edition)[M].Cambridge,Massachusetts London,England:The MIT Press,2001.
  • 10Bentley J L,Shamos M I.Divide-and-conquer in multidimensional space[C].Proceedings of the Eighth Annual ACM Symposium on Theory of Computing (Proceeding STOC '76),1976,220-230.

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部