This HTML5 document contains 56 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n14http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Mesh_2/
n12http://wias-berlin.de/software/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n6http://dbpedia.org/resource/File:
n18https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n17https://web.archive.org/web/20181229075437/http:/wias-berlin.de/software/
n7http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n20https://www.cs.cmu.edu/~quake/
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Delaunay_refinement
rdfs:label
Delaunay refinement
rdfs:comment
In mesh generation, Delaunay refinement are algorithms for mesh generation based on the principle of adding Steiner points to the geometry of an input to be meshed, in a way that causes the Delaunay triangulation or constrained Delaunay triangulation of the augmented input to meet the quality requirements of the meshing application. Delaunay refinement methods include methods by Chew and by Ruppert.
foaf:depiction
n7:RuppertsAlgorithm-output.png n7:LakeMichiganMesh.png n7:RuppertsAlgorithm-input.png
dcterms:subject
dbc:Articles_containing_video_clips dbc:Triangulation_(geometry) dbc:Mesh_generation
dbo:wikiPageID
14077942
dbo:wikiPageRevisionID
1117722169
dbo:wikiPageWikiLink
dbr:Computational_fluid_dynamics n6:RuppertsAlgorithm.ogv dbr:Voronoi_diagram dbr:Triangle_(software) dbc:Articles_containing_video_clips dbr:Circumcenter dbr:Ruppert's_algorithm n6:LakeMichiganMesh.png dbr:Mesh_generation dbr:Constrained_Delaunay_triangulation dbr:Algorithm dbc:Triangulation_(geometry) dbr:Finite_element_method dbr:Unstructured_grid dbr:Planar_straight-line_graph dbr:Piecewise_linear_manifold dbr:Delaunay_triangulation dbc:Mesh_generation dbr:Steiner_point_(computational_geometry) dbr:Local_feature_size dbr:Polygon_mesh dbr:TetGen
dbo:wikiPageExternalLink
n12:index.jsp%3Fid=TetGen&lang=1 n14:Chapter_main.html n17:index.jsp%3Fid=TetGen&lang=1 n20:triangle.html
owl:sameAs
wikidata:Q105742691 n18:FskPZ
dbp:wikiPageUsesTemplate
dbt:Multiple_image dbt:Mesh_generation dbt:Reflist dbt:Cite_web
dbo:thumbnail
n7:LakeMichiganMesh.png?width=300
dbp:alt
Output conforming Delaunay triangulation Ruppert's Algorithm input
dbp:caption
Output conforming Delaunay triangulation Input planar straight-line graph
dbp:direction
vertical
dbp:footer
Example of Ruppert's algorithm
dbp:image
RuppertsAlgorithm-input.png RuppertsAlgorithm-output.png
dbp:width
350
dbo:abstract
In mesh generation, Delaunay refinement are algorithms for mesh generation based on the principle of adding Steiner points to the geometry of an input to be meshed, in a way that causes the Delaunay triangulation or constrained Delaunay triangulation of the augmented input to meet the quality requirements of the meshing application. Delaunay refinement methods include methods by Chew and by Ruppert.
prov:wasDerivedFrom
wikipedia-en:Delaunay_refinement?oldid=1117722169&ns=0
dbo:wikiPageLength
9952
foaf:isPrimaryTopicOf
wikipedia-en:Delaunay_refinement