Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Ruppert's_algorithm> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Ruppert's_algorithm abstract "In mesh generation, Ruppert's algorithm, also known as Delaunay refinement, is an algorithm for creating quality Delaunay triangulations. The algorithm takes a planar straight-line graph (or in dimension higher than two a piecewise linear system) and returns a conforming Delaunay triangulation of only quality triangles. A triangle is considered poor-quality if it has a circumradius to shortest edge ratio larger than some prescribed threshold. Discovered by Jim Ruppert in the early 1990s,"Ruppert's algorithm for two-dimensional quality mesh generation is perhaps the first theoretically guaranteed meshing algorithm to be truly satisfactory in practice."".
- Ruppert's_algorithm thumbnail RuppertsAlgorithm-input.png?width=300.
- Ruppert's_algorithm wikiPageExternalLink index.html.
- Ruppert's_algorithm wikiPageExternalLink tetgen.berlios.de.
- Ruppert's_algorithm wikiPageExternalLink Chapter_main.html.
- Ruppert's_algorithm wikiPageExternalLink triangle.html.
- Ruppert's_algorithm wikiPageID "14077714".
- Ruppert's_algorithm wikiPageRevisionID "601888293".
- Ruppert's_algorithm alt "Output conforming Delaunay triangulation".
- Ruppert's_algorithm alt "Ruppert's Algorithm input".
- Ruppert's_algorithm caption "Input planar straight-line graph".
- Ruppert's_algorithm caption "Output conforming Delaunay triangulation".
- Ruppert's_algorithm direction "vertical".
- Ruppert's_algorithm footer "Example of Ruppert's algorithm".
- Ruppert's_algorithm hasPhotoCollection Ruppert's_algorithm.
- Ruppert's_algorithm image "RuppertsAlgorithm-input.png".
- Ruppert's_algorithm image "RuppertsAlgorithm-output.png".
- Ruppert's_algorithm width "350".
- Ruppert's_algorithm subject Category:Mesh_generation.
- Ruppert's_algorithm subject Category:Triangulation_(geometry).
- Ruppert's_algorithm comment "In mesh generation, Ruppert's algorithm, also known as Delaunay refinement, is an algorithm for creating quality Delaunay triangulations. The algorithm takes a planar straight-line graph (or in dimension higher than two a piecewise linear system) and returns a conforming Delaunay triangulation of only quality triangles. A triangle is considered poor-quality if it has a circumradius to shortest edge ratio larger than some prescribed threshold.".
- Ruppert's_algorithm label "Ruppert's algorithm".
- Ruppert's_algorithm sameAs m.03csvv4.
- Ruppert's_algorithm sameAs Q7380429.
- Ruppert's_algorithm sameAs Q7380429.
- Ruppert's_algorithm wasDerivedFrom Ruppert's_algorithm?oldid=601888293.
- Ruppert's_algorithm depiction RuppertsAlgorithm-input.png.
- Ruppert's_algorithm isPrimaryTopicOf Ruppert's_algorithm.
