Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Semi-Yao_graph> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Semi-Yao_graph abstract "The k-semi-Yao graph (k-SYG) of a set of n objects P is a geometric proximity graph, which was first described to present a kinetic data structure for maintenance of all the nearest neighbors on moving objects. It is named for its relation to the Yao graph, which is named after Andrew Yao.".
- Semi-Yao_graph wikiPageID "45410332".
- Semi-Yao_graph wikiPageLength "2770".
- Semi-Yao_graph wikiPageOutDegree "10".
- Semi-Yao_graph wikiPageRevisionID "699658925".
- Semi-Yao_graph wikiPageWikiLink Andrew_Yao.
- Semi-Yao_graph wikiPageWikiLink Category:Computational_geometry.
- Semi-Yao_graph wikiPageWikiLink Category:Geometric_graphs.
- Semi-Yao_graph wikiPageWikiLink Delaunay_triangulation.
- Semi-Yao_graph wikiPageWikiLink Geometric_spanner.
- Semi-Yao_graph wikiPageWikiLink Kinetic_data_structure.
- Semi-Yao_graph wikiPageWikiLink Nearest_neighbor_graph.
- Semi-Yao_graph wikiPageWikiLink Theta_graph.
- Semi-Yao_graph wikiPageWikiLink Yao_graph.
- Semi-Yao_graph wikiPageWikiLinkText "Semi-Yao graph".
- Semi-Yao_graph wikiPageUsesTemplate Template:Reflist.
- Semi-Yao_graph subject Category:Computational_geometry.
- Semi-Yao_graph subject Category:Geometric_graphs.
- Semi-Yao_graph hypernym Graph.
- Semi-Yao_graph type Software.
- Semi-Yao_graph comment "The k-semi-Yao graph (k-SYG) of a set of n objects P is a geometric proximity graph, which was first described to present a kinetic data structure for maintenance of all the nearest neighbors on moving objects. It is named for its relation to the Yao graph, which is named after Andrew Yao.".
- Semi-Yao_graph label "Semi-Yao graph".
- Semi-Yao_graph sameAs m.012vtpbn.
- Semi-Yao_graph wasDerivedFrom Semi-Yao_graph?oldid=699658925.
- Semi-Yao_graph isPrimaryTopicOf Semi-Yao_graph.