A New Robust Algorithm for Identifying the Orientation of Polygons Containing Arc

Article Preview

Abstract:

In this paper, we revisit the problem of identifying the orientation of polygons. After reviewing previous work, we develop further insight into the problem. We then claim that, for a orientable simple polygon, a relationship between the orientation and the sequence of extreme vertices can be found. Building upon this relationship, a novel method is then presented, proved by apagoge, and tested. For the polygons containing circular arc, which the traditional algorithm does not work, a topological preprocessing is developed. The ideas proposed in this paper are simple and effective when used in industry. Experimental results are presented that demonstrate its practicality and efficiency in the manufacturing industry.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3549-3554

Citation:

Online since:

August 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Feito F R, Torres J C, Urena. Computers & Graphics, 1995, 19( 4): 595~600.

Google Scholar

[2] Zhou Peide. Journal of Softw are, 1995, 6( 5): 275~ 279.

Google Scholar

[3] Wang Zhiqiang, Xiao Lijin, Hong Jiazhen. Chinese Journal of Computers, 1998, 21 (2): 183~187. (In Chinese).

Google Scholar

[4] Liu Runtao. Journal of Software, 2002, 13(7): 1309~1312.

Google Scholar

[5] Jin Wenhua, Tang Rongxi, He Tao. Computer Engineering and Design, 1999, 20(5): 7~10. (In Chinese).

Google Scholar

[6] Chen Bingfa, Qian Zhifeng, Liao Wenhe. Journalof Computer Aided Design & Computer Graphics, 2002, 14(3): 214~ 217. (In Chinese).

Google Scholar

[7] Li Weishi, Li Jiangxiong, Ke Yinglin. Journal of Computer Aided Design & Computer Graphics, 2000, 12(6): 405~ 407. (In Chinese).

Google Scholar