Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
In this article, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Over the past 10 years or so the “Field” of “Mixed Methods Research” (MMR) has increasingly been exerting itself as something… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper introduces a new definition of dense subgraph pattern, the DN -graph. DN -graph considers both the size of the… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This article refers to a study in Tanzania on fringe benefits or welfare via the work contract1 where we will work both… Expand
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A set ofn weighted points in general position in ℝd defines a unique regular triangulation. This paper proves that if the points… Expand
  • figure 4.1
  • figure 4.2
  • figure 5.1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We use the Cayley Trick to study polyhedral subdivisions of the product of two simplices. For arbitrary (fixed) l ≥ 2, we show… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
There are $339$ combinatorial types of generic metrics on six points. They correspond to the $339$ regular triangulations of the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We present a simple new algorithm for triangulating polygons and planar straightline graphs, It provides "shape" and "size… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A set ofn weighted points in general position in ℝ d defines a unique regular triangulation. This paper proves that if the points… Expand
  • figure 4.2
  • figure 4.1
  • figure 5.1
Is this relevant?