This HTML5 document contains 45 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/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n20http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n4http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
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#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Kinetic_closest_pair
rdf:type
yago:WikicatGeometricDataStructures yago:DataStructure105728493 yago:Structure105726345 yago:PsychologicalFeature100023100 dbo:Building yago:Cognition100023271 yago:Abstraction100002137 yago:Arrangement105726596 yago:WikicatKineticDataStructures
rdfs:label
Kinetic closest pair
rdfs:comment
A kinetic closest pair data structure is a kinetic data structure that maintains the closest pair of points, given a set P of n points that are moving continuously with time in a metric space. While many efficient algorithms were known in the static case, they proved hard to kinetize, so new static algorithms were developed to solve this problem.
foaf:depiction
n4:Kinetic_closest_pair_preliminaries.png
dcterms:subject
dbc:Kinetic_data_structures dbc:Geometric_data_structures
dbo:wikiPageID
35773565
dbo:wikiPageRevisionID
1071403293
dbo:wikiPageWikiLink
dbr:Closest_pair_of_points dbr:Range_tree dbc:Geometric_data_structures dbr:Equilateral_triangle dbc:Kinetic_data_structures dbr:Nearest_neighbor_graph dbr:Kinetic_priority_queue dbr:Kinetic_data_structure n20:Kinetic_closest_pair_preliminaries.png dbr:Delaunay_triangulation dbr:Kinetic_sorted_list dbr:Kinetic_tournament
owl:sameAs
yago-res:Kinetic_closest_pair n15:4pWoK freebase:m.0jwqzqz wikidata:Q6410773
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Use_American_English dbt:Short_description dbt:Radical dbt:Pi dbt:Mvar dbt:Math
dbo:thumbnail
n4:Kinetic_closest_pair_preliminaries.png?width=300
dbo:abstract
A kinetic closest pair data structure is a kinetic data structure that maintains the closest pair of points, given a set P of n points that are moving continuously with time in a metric space. While many efficient algorithms were known in the static case, they proved hard to kinetize, so new static algorithms were developed to solve this problem.
gold:hypernym
dbr:Structure
prov:wasDerivedFrom
wikipedia-en:Kinetic_closest_pair?oldid=1071403293&ns=0
dbo:wikiPageLength
7803
foaf:isPrimaryTopicOf
wikipedia-en:Kinetic_closest_pair