Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《JOURAAL OF COMPUTER AIDED DESIGN & COMPUTER GRAPHICS》 1998-03
Add to Favorite Get Latest Update

A NEW ALGORITHM FOR DYNAMIC COMPUTING THE AREA OF UNION OF CIRCULAR ARCS

CHEN Jian Xun MA Heng Tai (Department of Automation, Wuhan Yejin University of Science and Technology, Wuhan 430081)  
The computing of the area covered by N circles placed randomly on a plane is called the computing of the area of the union of circular arcs. It is not only practical but also an important algorithm in Computational geometry, CAD/CAM and Computer graphics. Giving the formula for the computing of polygon area and central angle with constrain arc, based on the computing of intersection of arcs and polygon area and sector area, this paper proposed a new algorithm for computing the area of the union of circular arcs dynamically. This algorithm is characterized by its high speed and high accuracy. The computational time is not affected by the accuracy required and the size of the circle. It can be applied to all the cases for the computing of the area of the union of circular arcs and can be used widely with its user friendly interface.
【Key Words】: the area of union of circular arcs the directed polygon area the complexity of algorithm computational geometry
【CateGory Index】: TP391,TP391.75
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【References】
Chinese Journal Full-text Database 3 Hits
1 YUAN Ping Peng CHEN Gang DONG Jin Xiang (State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou 310027) (Institute of Artificial Intelligence, Zhejiang University, Hangzhou 310027);Prove and Refinement of Algorithm for Dynamic Computing Union Area of Circular Arcs[J];Journal of Computer Aided Design & Computer Graphics;2001-01
2 Liu Yong Xu Congfu Chen Weidong Pan Yunhe(State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou 310027)(Institute of Artificial Intelligence, Zhejiang University, Hangzhou 310027);A Novel Algorithm for Computing the Area Formulation of Simple Irregular Polygons with Arc[J];Journal of Computer Aided Design & Computer Graphics;2005-04
3 Du Li Liu Jianqun Duan Zhengcheng Xu Yuncheng;Research on the Formation of Cutting Contour Graph of Sheet Metal Part[J];Journal of Wuhan Textile S. & T. Institute;1998-04
China Proceedings of conference Full-text Database 1 Hits
1 CHEN Jian-xun ZHAO Hui Dept. of Computer Science & technology, Wuhan University of Science & Technology, Wuhan Hubei 430081;A New Algorithm for Dynamic Computing the Perimeter of Union of Circular Arcs[A];[C];2007
【Co-references】
Chinese Journal Full-text Database 10 Hits
1 Wang Shuyu,Liu Guohua,Liu Lijun,Zhang Li (Zhejiang University, Hangzhou 310027, China);DISCUSSION ON SEVERAL NEW METHODS FOR ANALYZING OBSERVATIONAL DATA OF DAMS Part One Regression-time Series Analysis and Bayesian Model[J];Dam Observation and Geotechnical Tests;2003-02
2 WANG Shou jue,WANG Bai nan (Lab of Artificial Neural Networks,Institute of Semiconductors,CAS,Beijing 100083,China);Analysis and Theory of High-Dimension Space Geometry for Artificial Neural Networks[J];Acta Electronica Sinica;2002-01
3 Zhu Renzhi;Meng Weihua(University of Science and Technology of China);A NEW ALGORITHM ON ONE-DIMENSION BOOLEAN OPERATION IN TERMS OF GEOMETRIC MODELING[J];JOURNAL OF ENGINEERING GRAPHICS;1994-01
4 Wang Shiping; Wang Zhiqiang(Xian Electronic Polytechnic University);GENERAL CLIPPING AGAINST GENERALIZED POLYGANS[J];JOURNAL OF ENGINEERING GRAPHICS;1995-01
5 YE Shi Ren, YOU Xiang Tao, SHI Zhong Zhi, and LI Xiao Li (Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080);EFFICIENT SIMILARITY COMPUTING METHODS IN HIGH DIMENSIONAL DATA[J];JOURNAL OF COMPUTER RESEARCH AND DEVELOPMENT;2000-10
6 ZHU Ya Yin 1, WANG Hua Wen 1, WAN Feng 1, and YU Lei Yi 2 1(School of Computer Science, Wuhan University, Wuhan 430072) 2(Institute of Remote Sensing and Information Engineering, Wuhan University, Wuhan 430072);An Algorithm for Determining the Intersection, Union, and Difference of Any Two Polygons[J];Journal of Computer Research and Development;2003-04
7 Liu Yongkui Liu Guifang Computer Engineering College, Shenyang Polytechnic University, Shenyang, 110021;LINE CLIPPING AGAINST A GENERALIZED POLYGON[J];Journal of Computer Aided Design & Computer Graphics;1993-04
8 Dong Weiming 1) Maira Babang 1) Zhou Dengwen 2) Sun Jiaguang 1) 1)(Department of Computer Science and Technology, Tsinghua University, Beijing 100084) 2)(Department of Computer Science and Technology, North China Electric Power University, Beijing 102206);Boolean Operations on General Planar Curved-Edge Polygons[J];Journal of Computer Aided Design & Computer Graphics;2003-09
9 Yan Dongming Dong Weiming Sun Jiaguang (Department of Computer Science and Technology, Tsinghua University, Beijing 100084);Construction of Layer-Based Representation for Curved-Edge Polygons and Its Applications[J];Journal of Computer Aided Design & Computer Graphics;2004-01
10 Liu Yong Xu Congfu Chen Weidong Pan Yunhe(State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou 310027)(Institute of Artificial Intelligence, Zhejiang University, Hangzhou 310027);A Novel Algorithm for Computing the Area Formulation of Simple Irregular Polygons with Arc[J];Journal of Computer Aided Design & Computer Graphics;2005-04
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved