Efficient Polygon Edge Enumeration

Sean Barrett

This paper appears in issue Volume 10, Number 2.
Purchase this issue from the akpeters.com web site.

Abstract

Enumerating the set of polygon edges given an array of vertices can lead to inefficient code to handle the edge connecting the first and last vertex of the array. This article presents a simple method for efficiently iterating through the edges. While this method has been in use for a long time, it is not widely known.

Author Information

Sean Barrett sean@nothings.org

BibTeX Entry

@article{Barrett05,
  author = "Sean Barrett",
  title = "Efficient Polygon Edge Enumeration",
  journal = "journal of graphics tools",
  volume = "10",
  number = "2",
  pages = "51-53",
  year = "2005",
}