A Triangulation Algorithm for General Plane Polygon
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Considering the triangulation algorithm based only on the determination of convex-concave vertices is restricted to simple polygons, this paper presents a triangulation algorithm for the general plane polygon GTP(General Triangulation of Polygons) based on determination of convex-concave vertices and connecting the outer border of a polygon with its inner borders. GTP is rapid and can be applied to any plane polygon. GTP has been implemented and acquired good effect in application.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 11,1999
  • Revised:
  • Adopted:
  • Online: November 18,2013
  • Published:
Article QR Code