A Simple Polygon Triangulation Algorithm

Abstract

In this Paper we propose an easily implementable polygon triangulation algorithm using Shortest Paths. The algorithm runs in O(nlogk) deterministic time with k < n 3 . Our algorithm runs in linear time for a large class of polygons. The biggest advantage of the algorithm is that it uses very simple data structures and it computes the triangulation just by… (More)

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Kumar1999ASP, title={A Simple Polygon Triangulation Algorithm}, author={Piyush Kumar and Subir Kumar Ghosh}, year={1999} }