This HTML5 document contains 65 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/
foafhttp://xmlns.com/foaf/0.1/
n12https://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/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n19https://archive.org/details/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Proximity_problems
rdf:type
yago:Rule105846932 yago:Event100029378 yago:Procedure101023820 yago:Activity100407535 yago:WikicatGeometricAlgorithms yago:Algorithm105847438 yago:Abstraction100002137 yago:PsychologicalFeature100023100 dbo:Disease yago:YagoPermanentlyLocatedEntity yago:Act100030358
rdfs:label
Proximity problems
rdfs:comment
Proximity problems is a class of problems in computational geometry which involve estimation of distances between geometric objects. A subset of these problems stated in terms of points only are sometimes referred to as closest point problems, although the term "closest point problem" is also used synonymously to the nearest neighbor search.
dcterms:subject
dbc:Geometric_algorithms
dbo:wikiPageID
11164440
dbo:wikiPageRevisionID
1014074471
dbo:wikiPageWikiLink
dbr:Euclidean_minimum_spanning_tree dbr:Distance_from_a_point_to_a_line dbr:Largest_empty_rectangle dbr:Smallest_enclosing_rectangle dbr:Springer-Verlag dbr:Smallest_enclosing_sphere dbr:Bounding_box dbr:Computational_complexity_theory dbr:Big_O_notation dbr:Width_of_a_point_set dbr:Nearest-neighbor_graph dbr:Michael_Ian_Shamos dbr:Largest_empty_circle dbr:Geometric_spanner dbr:Shortest_path_among_obstacles dbr:Delaunay_triangulation dbr:Line_segment dbr:Closest_pair_of_points dbr:Nearest_neighbor_query dbr:Diameter_of_a_point_set dbr:Convex_hull dbr:Computational_geometry dbr:Hyperrectangle dbr:Nearest_neighbor_search dbr:Lower_bound dbr:Element_uniqueness_problem dbr:Weighted_graph dbr:Distance_of_closest_approach_of_ellipses_and_ellipsoids dbr:Minimum_spanning_tree dbr:Franco_P._Preparata dbr:Voronoi_diagram dbr:Closest_point_query dbc:Geometric_algorithms dbr:Distance
dbo:wikiPageExternalLink
n19:computationalgeo0000prep
owl:sameAs
wikidata:Q7252872 yago-res:Proximity_problems n12:4tjT2 freebase:m.02r264b
dbp:wikiPageUsesTemplate
dbt:Use_mdy_dates dbt:Short_description dbt:Use_American_English dbt:Cite_book dbt:ISBN
dbo:abstract
Proximity problems is a class of problems in computational geometry which involve estimation of distances between geometric objects. A subset of these problems stated in terms of points only are sometimes referred to as closest point problems, although the term "closest point problem" is also used synonymously to the nearest neighbor search. A common trait for many of these problems is the possibility to establish the Θ(n log n) lower bound on their computational complexity by reduction from the element uniqueness problem basing on an observation that if there is an efficient algorithm to compute some kind of minimal distance for a set of objects, it is trivial to check whether this distance equals to 0.
gold:hypernym
dbr:Problems
prov:wasDerivedFrom
wikipedia-en:Proximity_problems?oldid=1014074471&ns=0
dbo:wikiPageLength
4112
foaf:isPrimaryTopicOf
wikipedia-en:Proximity_problems