Skip to search formSkip to main contentSkip to account menu

Point set triangulation

Known as: Point-set triangulation, Triangulation (disambiguation) 
A triangulation of a set of points in the Euclidean space is a simplicial complex that covers the convex hull of , and whose vertices belong to . In… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
For a shape-regular triangulation $${\mathcal{T}_h}$$ without obtuse angles of a bounded polygonal domain $${\Omega\subset\Re^2… 
2008
2008
Triangulation was originated by navigators who located or verified positions with multiple bearings or measurements, but it is… 
2007
2007
We present a new, single‐rate method for compressing the connectivity information of a connected 2‐manifold triangle mesh with or… 
2004
2004
A great challenge for flow simulators of new generation is to gain more accuracy at well proximity within complex geological… 
2002
2002
We show that the exact number of triangulations of the standard cyclic polytope C(n,n-4) is (n+4)2(n-4)/2-n if n is even and… 
1995
1995
SummaryWe study that subset of the moduli space $$\bar M^g $$ of stable genusg,g>1, Riemann surfaces which consists of such… 
1989
1989
We show that for a subanalytic function / on a locally compact subanalytic set X there exists a unique subanalytic triangulation… 
Highly Cited
1976
Highly Cited
1976
This paper introduces theoretical measures of efficiency for triangulations used in computing fixed points. The measures, for…