# Linear Time Triangulation of Simple Polygons

@inproceedings{Boyd2009LinearTT, title={Linear Time Triangulation of Simple Polygons}, author={Landon Boyd}, year={2009} }

- Published 2009

From the early days of computational geometry, practitioners have looked for faster ways to triangulate a simple polygon. Several near-linear time algorithms have been devised and implemented. However, the true linear time algorithms of Chazelle and Amato et al. are considered impractical for actual use despite their faster asymptotic running time. In this paper, I examine the latter of these in detail and attempt to implement it.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 14 REFERENCES

## A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Cs633: Final project

VIEW 1 EXCERPT

## CMSC 754 Computational Geometry 1

VIEW 1 EXCERPT

## Triangulations and Mesh Generation

VIEW 1 EXCERPT

## Fast Polygon Triangulation Based on Seidel's Algorithm

VIEW 1 EXCERPT

## Triangulating a simple polygon in linear time

VIEW 2 EXCERPTS