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… 
2006
2006
Persistent Grid Mapping : A GPU-based Framework for Interactive Terrain Rendering
In this paper we present the Persistent Grid Mapping (PGM), a novel framework for interactive terrain rendering that provides a… 
Highly Cited
2003
Highly Cited
2003
Registration and fusion of intensity and range data for 3D modelling of real world scenes
A novel technique combining intensity and range data is presented. Passive (intensity based) and active (range based) techniques… 
2000
2000
Probe Interval Graph and Its Applications to Physical Mapping of DNA
A new class of graph called the probe interval graph has been introduced. It is an extension of the interval graph. It requires… 
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… 
1996
1996
History consideration in reconstructing polyhedral surfaces from parallel slices
We introduce an algorithm for reconstructing a solid model given a series of planar cross sections. The main contribution of this… 
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… 
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)