Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Theta_graph> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Theta_graph abstract "In computational geometry, the Theta graph, or -graph, is a type of geometric spanner similar to a Yao graph. The basic method of construction involves partitioning the space around each vertex into a set of cones, which themselves partition the remaining vertices of the graph. Like Yao Graphs, a -graph contains at most one edge per cone; where they differ is how that edge is selected. Whereas Yao Graphs will select the nearest vertex according to the metric space of the graph, the -graph defines a fixed ray contained within each cone (conventionally the bisector of the cone) and selects the nearest neighbour with respect to orthogonal projections to that ray. The resulting graph exhibits several good spanner properties.-graphs were first described by Clarkson in 1987 and independently byKeil in 1988.".
- Theta_graph thumbnail Theta-cone.svg?width=300.
- Theta_graph wikiPageExternalLink misc.html.
- Theta_graph wikiPageID "2472919".
- Theta_graph wikiPageRevisionID "549565432".
- Theta_graph hasPhotoCollection Theta_graph.
- Theta_graph subject Category:Computational_geometry.
- Theta_graph subject Category:Geometric_graph_theory.
- Theta_graph comment "In computational geometry, the Theta graph, or -graph, is a type of geometric spanner similar to a Yao graph. The basic method of construction involves partitioning the space around each vertex into a set of cones, which themselves partition the remaining vertices of the graph. Like Yao Graphs, a -graph contains at most one edge per cone; where they differ is how that edge is selected.".
- Theta_graph label "Theta graph".
- Theta_graph sameAs m.0s8v4ym.
- Theta_graph sameAs Q17104040.
- Theta_graph sameAs Q17104040.
- Theta_graph wasDerivedFrom Theta_graph?oldid=549565432.
- Theta_graph depiction Theta-cone.svg.
- Theta_graph isPrimaryTopicOf Theta_graph.
