By Topic

Detecting Ambiguities in 3D Polygons with Self-Intersecting Projections

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Weishi Li ; Sch. of Instrum. Sci., Hefei Univ. of Technol., Hefei, China

If a given 3D polygon has a self-intersecting projection which can bound several in equivalent disk-like surfaces in space, we say the polygon is ambiguous. In this paper, we propose a decomposition scheme for 3D polygons using Gauss diagrams from knot theory, and use it to detect ambiguities of 3D polygons.

Published in:

Computer-Aided Design and Computer Graphics (CAD/Graphics), 2011 12th International Conference on

Date of Conference:

15-17 Sept. 2011