By Topic

A Unified Algorithm for Boolean Shape Operations

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
$31 $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

2 Author(s)
Yamaguchi, F. ; Kyushu Institute of Design ; Tokieda, T.

A Boolean shape operation algorithm which is based on triangulation of potentially intersecting faces is proposed. The essential part of the algorithm is a method for mutual processing of intersecting triangular pairs. This triangulation method is very effective in simplifying the algorithm and in reducing the system size. The method is suitable for hardware implementation because the simple routines for processing the intersecting pairs appear frequently in the algorithm. In determining points on an intersecting line loop, previous computational results can be utilized to calculate the next point, helping to speed up the algorithm.

Published in:

Computer Graphics and Applications, IEEE  (Volume:4 ,  Issue: 6 )