# Polygon triangulation

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Encyclopedia of Algorithms
- 2016

Polygon Triangulation â€¢ A polygonal curve is a finite chain of line segments. â€¢ Line segments called edges, their endpointsâ€¦Â (More)

Is this relevant?

2015

2015

- 2015

We present an experimental study of different strategies for triangulating polygons in parallel. As usual, we call threeâ€¦Â (More)

Is this relevant?

2013

2013

- ArXiv
- 2013

A basic and an improved ear-clipping based algorithm for triangulating simple polygons and polygons with holes are presented. Inâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Robotics
- 2005

In this paper, we present a computational framework for automatic generation of provably correct control laws for planar robotsâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 2004

The surfaces considered in surface reconstruction are two-manifolds that might have boundaries and are embedded in some Euclideanâ€¦Â (More)

Is this relevant?

2001

2001

- Algorithmica
- 2001

We discuss a triangulation algorithm that is based on repeatedly clipping ears of a polygon. The main focus of our work was onâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- The Visual Computer
- 1998

Surface triangulations are necessary in applying finite element methods for solving mechanical problems and for displayingâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- J. Comput. Syst. Sci.
- 1995

We show how to construct an O p n separator decomposition of a planar graph G in O n time Such a decomposition de nes a binaryâ€¦Â (More)

Is this relevant?

1986

1986

- J. Algorithms
- 1986

In this paper we show that Q( n log n) operations are necessary to triangulate a polygonal region with n vertices which containsâ€¦Â (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- ACM Trans. Graph.
- 1984

It' has long been known that the complexity of triangulation of simple polygons having an upper bound of 0 (n log n) but a lowerâ€¦Â (More)

Is this relevant?