Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

28 relations
Alain FournierAll nearest smaller valuesArt gallery problemComputational geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
TOPOLOGICAL TRIANGULATED CATEGORIES
In this paper we explain certain systematic differences between algebraic and topological triangulated categories. A triangulated… 
2009
2009
De aluno a enfermeiro: desenvolvimento de competências em contexto de ensino clínico
  • M. Rua
  • 2009
  • Corpus ID: 149705304
Nursing education has followed the sociocultural and scientific and technological evolution in an attempt to find answer to the… 
2007
2007
Curved TV: The Impact of Televisual Images on Gay Youth
This paper outlines the conclusions of the author’s dissertation, which examined how the current portrayals of gays and lesbians… 
2007
2007
Surface based cardiac and respiratory motion extraction for pulmonary structures from multi-phase CT
During medical imaging and therapeutic interventions, pulmonary structures are in general subject to cardiac and respiratory… 
2004
2004
Efficient Edgebreaker for surfaces of arbitrary topology
The typical surface models handled by contemporary computer graphics applications have millions of triangles and numerous… 
Review
2003
Review
2003
Texas Voices Speak out about High-Stakes Testing: Preservice Teachers, Teachers, and Students
Although teachers and students are directly impacted by high-stakes testing policy mandates, their opinion is often left out… 
1999
1999
Spiraling Edge: fast surface reconstruction from partially organized sample points
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction… 
1993
1993
Triangulating Three-Colored Graphs in Linear Time and Linear Space
Kannan and Warnow [Triangulating Three-Colored Graphs, Proc. 2nd SODA, 1991, pp. 337–343 and SIAM J. Discrete Math., 5 (1992), pp… 
1986
1986
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
1975
1975
A note on continuity of semigroups of maps
An example is given of a separately continuous semigroup of transformations on Hilbert space which fails to be jointly continuous… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)