Ruppert's algorithm

Known as: Delaunay Refinement, Ruppert 
In mesh generation, Ruppert's algorithm, also known as Delaunay refinement, is an algorithm for creating quality Delaunay triangulations. The… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A planar straight-line graph which causes the non-termination Ruppert’s algorithm for a minimum angle threshold α ' 29.5 is given… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
In this paper, we consider the minimization of a convex objective function defined on a Hilbert space, which is only available… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2008
2008
Ruppert’s algorithm [6] is an elegant method for generating size-competitive meshes, but admits a poor worst case run-time… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
s for Trends in Unstructured Mesh Generation 1 Application of smoothing techniques for aligning meshes José M. Escobar University… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Measurement is critical to the social scientific enterprise. Many key concepts in socialscientific theories are not observed… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2003
2003
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Triangle is a C program for two-dimensional mesh generation and construction of Delaunay triangulations, constrained Delaunay… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… (More)
  • figure 27
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We present a simple new algorithm for triangulating polygons and planar straightline graphs. It provides “shape” and %izen… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 7
  • figure 4
Is this relevant?