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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
This paper outlines the conclusions of the author’s dissertation, which examined how the current portrayals of gays and lesbians… 
2007
2007
During medical imaging and therapeutic interventions, pulmonary structures are in general subject to cardiac and respiratory… 
2006
2006
In this paper we present the Persistent Grid Mapping (PGM), a novel framework for interactive terrain rendering that provides a… 
2004
2004
The typical surface models handled by contemporary computer graphics applications have millions of triangles and numerous… 
Highly Cited
2003
Highly Cited
2003
A novel technique combining intensity and range data is presented. Passive (intensity based) and active (range based) techniques… 
2000
2000
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
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction… 
1997
1997
This paper presents two practical studies on the helicopter-based use of a high-resolution digital still-video camera for digital… 
1996
1996
We introduce an algorithm for reconstructing a solid model given a series of planar cross sections. The main contribution of this… 
1993
1993
Kannan and Warnow [Triangulating Three-Colored Graphs, Proc. 2nd SODA, 1991, pp. 337–343 and SIAM J. Discrete Math., 5 (1992), pp…