Home > Science > Mathematics > Geometry > Computational
Ear Cutting for Simple Polygons by Ian Garton Contents Introduction to Ear Cutting for Simple Polygons The Two-Ears Theorem An O(kn) Time Algorithm For Finding an Ear An O(n) Time Algorithm For Finding an Ear Interactive Ear Cutting! The One-Mouth Theorem Interactive Mouth Closing! Glossary of Terms References This page was last updated on Wednesday, December 10th, 1997. 1997 Ian Inc. ...
cgm.cs.mcgill.ca/~godfried/teaching/cg-projects/97/Ian/cutting_ears.html
Post a Review
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Please note, all comments are subject to review and can be removed at any time for any reason.
Disclaimer: eiNET is not affiliated in any way with the Computational Geometry - Ear Cutting for Simple Polygons (cgm.cs.mcgill.ca/~godfried/teaching/cg-projects/97/Ian/cutting_ears.html) website.
Views and opinions expressed may not be representative of eiNET or its owners but all effort is made to keep the site free of obscenities, illegal or otherwise malicious activity.
Are you the owner of this site? You can manage your listing here.