HTML Microdata document

This HTML5 document contains 47 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/
n14	http://dbpedia.org/resource/File:
foaf	http://xmlns.com/foaf/0.1/
n17	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
n6	http://commons.wikimedia.org/wiki/Special:FilePath/
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#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Geometric_spanner
dbo:wikiPageWikiLink: dbr:Well-separated_pair_decomposition

Subject Item: dbr:Delone_set
dbo:wikiPageWikiLink: dbr:Well-separated_pair_decomposition

Subject Item: dbr:Prefix_sum
dbo:wikiPageWikiLink: dbr:Well-separated_pair_decomposition

Subject Item: dbr:Well-separated_pair_decomposition
rdfs:label: Well-separated pair decomposition
rdfs:comment: In computational geometry, a well-separated pair decomposition (WSPD) of a set of points , is a sequence of pairs of sets , such that each pair is well-separated, and for each two distinct points , there exists precisely one pair which separates the two. The graph induced by a well-separated pair decomposition can serve as a k-spanner of the complete Euclidean graph, and is useful in approximating solutions to several problems pertaining to this.
foaf:depiction: n6:Visual_representation_of_a_well-separated_pair_computed_with_the_bounding_boxes.svg n6:Visual_representation_of_well-separated_pair.svg
dcterms:subject: dbc:Computational_geometry
dbo:wikiPageID: 42316777
dbo:wikiPageRevisionID: 1069652723
dbo:wikiPageWikiLink: dbr:Computational_geometry dbr:Approximation_algorithm dbr:Complete_graph dbr:N-ball dbr:Closest_pair_problem dbr:Nearest_neighbor_search dbr:Fair_split_tree n14:Visual_representation_of_a_well-separated_pair_computed_with_the_bounding_boxes.svg n14:Visual_representation_of_well-separated_pair.svg dbc:Computational_geometry dbr:Euclidean_graph dbr:Diameter dbr:Graph_spanner dbr:Geometric_spanner dbr:Minimum_bounding_box dbr:Euclidean_minimum_spanning_tree
owl:sameAs: wikidata:Q17142115 freebase:m.0102cw1n n17:gBuA
dbp:wikiPageUsesTemplate: dbt:Math dbt:Frac dbt:Reflist dbt:! dbt:= dbt:Collapse_bottom dbt:Collapse_top
dbo:thumbnail: n6:Visual_representation_of_well-separated_pair.svg?width=300
dbo:abstract: In computational geometry, a well-separated pair decomposition (WSPD) of a set of points , is a sequence of pairs of sets , such that each pair is well-separated, and for each two distinct points , there exists precisely one pair which separates the two. The graph induced by a well-separated pair decomposition can serve as a k-spanner of the complete Euclidean graph, and is useful in approximating solutions to several problems pertaining to this.
prov:wasDerivedFrom: wikipedia-en:Well-separated_pair_decomposition?oldid=1069652723&ns=0
dbo:wikiPageLength: 13890
foaf:isPrimaryTopicOf: wikipedia-en:Well-separated_pair_decomposition

Subject Item: dbr:Euclidean_minimum_spanning_tree
dbo:wikiPageWikiLink: dbr:Well-separated_pair_decomposition

Subject Item: dbr:S._Rao_Kosaraju
dbo:wikiPageWikiLink: dbr:Well-separated_pair_decomposition

Subject Item: dbr:N-body_simulation
dbo:wikiPageWikiLink: dbr:Well-separated_pair_decomposition

Subject Item: dbr:Well-Separated_Pair_Decomposition
dbo:wikiPageWikiLink: dbr:Well-separated_pair_decomposition
dbo:wikiPageRedirects: dbr:Well-separated_pair_decomposition

Subject Item: wikipedia-en:Well-separated_pair_decomposition
foaf:primaryTopic: dbr:Well-separated_pair_decomposition