HTML Microdata document

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

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

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n11	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
n12	https://github.com/artem-ogre/
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:List_of_algorithms
dbo:wikiPageWikiLink: dbr:Constrained_Delaunay_triangulation

Subject Item: dbr:Delaunay_refinement
dbo:wikiPageWikiLink: dbr:Constrained_Delaunay_triangulation

Subject Item: dbr:Delaunay_triangulation
dbo:wikiPageWikiLink: dbr:Constrained_Delaunay_triangulation

Subject Item: dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink: dbr:Constrained_Delaunay_triangulation

Subject Item: dbr:Constrained_Delaunay_triangulation
rdfs:label: Constrained Delaunay triangulation
rdfs:comment: In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments into the triangulation as edges, unlike the Delaunay triangulation itself which is based purely on the position of a given set of vertices without regard to how they should be connected by edges. It can be computed efficiently and has applications in geographic information systems and in mesh generation.
dcterms:subject: dbc:Geometry_processing dbc:Triangulation_(geometry)
dbo:wikiPageID: 29638267
dbo:wikiPageRevisionID: 1117723803
dbo:wikiPageWikiLink: dbc:Triangulation_(geometry) dbr:Surveying dbr:Convex_hull dbr:Mesh_generation dbr:Linear_time dbr:Planar_straight-line_graph dbc:Geometry_processing dbr:Jonathan_Shewchuk dbr:Topographic dbr:Simple_polygon dbr:Delaunay_refinement dbr:Delaunay_triangulation dbr:Computational_geometry
dbo:wikiPageExternalLink: n12:CDT
owl:sameAs: n11:4iNeg freebase:m.0fph_47 wikidata:Q5164356
dbp:wikiPageUsesTemplate: dbt:Algorithm-stub dbt:Reflist
dbo:abstract: In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments into the triangulation as edges, unlike the Delaunay triangulation itself which is based purely on the position of a given set of vertices without regard to how they should be connected by edges. It can be computed efficiently and has applications in geographic information systems and in mesh generation.
gold:hypernym: dbr:Generalization
prov:wasDerivedFrom: wikipedia-en:Constrained_Delaunay_triangulation?oldid=1117723803&ns=0
dbo:wikiPageLength: 4480
foaf:isPrimaryTopicOf: wikipedia-en:Constrained_Delaunay_triangulation

Subject Item: dbr:Triangulation_(geometry)
dbo:wikiPageWikiLink: dbr:Constrained_Delaunay_triangulation

Subject Item: dbr:CDT
dbo:wikiPageWikiLink: dbr:Constrained_Delaunay_triangulation
dbo:wikiPageDisambiguates: dbr:Constrained_Delaunay_triangulation

Subject Item: dbr:Constrained_Delaunay_Triangulation
dbo:wikiPageWikiLink: dbr:Constrained_Delaunay_triangulation
dbo:wikiPageRedirects: dbr:Constrained_Delaunay_triangulation

Subject Item: wikipedia-en:Constrained_Delaunay_triangulation
foaf:primaryTopic: dbr:Constrained_Delaunay_triangulation