Polygon triangulation

Known as: Ear clipping, Polygon division, Triangulation (disambiguation) 
In computational geometry, polygon triangulation is the decomposition of a polygonal area (simple polygon) P into a set of triangles, i.e., finding a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
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
We present an experimental study of different strategies for triangulating polygons in parallel. As usual, we call three… (More)
  • figure 1
Is this relevant?
2013
2013
A basic and an improved ear-clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In this paper, we present a computational framework for automatic generation of provably correct control laws for planar robots… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • Frederic. Cazals
  • 2004
The surfaces considered in surface reconstruction are two-manifolds that might have boundaries and are embedded in some Euclidean… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
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
Surface triangulations are necessary in applying finite element methods for solving mechanical problems and for displaying… (More)
  • figure 1
  • figure 5
  • figure 6
  • figure 8
  • figure 7
Is this relevant?
Highly Cited
1995
Highly Cited
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
In this paper we show that Q( n log n) operations are necessary to triangulate a polygonal region with n vertices which contains… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1984
Highly Cited
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?