By Topic

Line/Polygon Classification: A Study of the Complexity of Geometric Computation

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)
Tilove, R.B. ; University of Rochester

Illuminating the techniques of computational geometry, an analysis of two LPC algorithms compares their efficiency for handling polygon-clipping problems.

Published in:

Computer Graphics and Applications, IEEE  (Volume:1 ,  Issue: 2 )