Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7380429> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Q7380429 subject Q8266666.
- Q7380429 subject Q8621804.
- Q7380429 subject Q8872361.
- Q7380429 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."".
- Q7380429 thumbnail RuppertsAlgorithm-input.png?width=300.
- Q7380429 wikiPageExternalLink tetgen.
- Q7380429 wikiPageExternalLink Chapter_main.html.
- Q7380429 wikiPageExternalLink triangle.html.
- Q7380429 wikiPageWikiLink Q110176.
- Q7380429 wikiPageWikiLink Q1154597.
- Q7380429 wikiPageWikiLink Q17078677.
- Q7380429 wikiPageWikiLink Q192445.
- Q7380429 wikiPageWikiLink Q220184.
- Q7380429 wikiPageWikiLink Q4418033.
- Q7380429 wikiPageWikiLink Q5094468.
- Q7380429 wikiPageWikiLink Q6664365.
- Q7380429 wikiPageWikiLink Q7191425.
- Q7380429 wikiPageWikiLink Q7200964.
- Q7380429 wikiPageWikiLink Q757267.
- Q7380429 wikiPageWikiLink Q7705967.
- Q7380429 wikiPageWikiLink Q815820.
- Q7380429 wikiPageWikiLink Q8266666.
- Q7380429 wikiPageWikiLink Q8366.
- Q7380429 wikiPageWikiLink Q8621804.
- Q7380429 wikiPageWikiLink Q8872361.
- Q7380429 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.".
- Q7380429 label "Ruppert's algorithm".
- Q7380429 depiction RuppertsAlgorithm-input.png.