Computational Geometry - Ear Cutting for Simple Polygons

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 10^th, 1997.

© 1997 Ian Inc.