Euclidean minimum spanning tree
GPTKB entity
Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:abbreviation |
gptkb:EMST
|
| gptkbp:application |
pattern recognition
clustering network design |
| gptkbp:complexity |
O(n log n) for 2D
|
| gptkbp:definedIn |
set of points in Euclidean space
|
| gptkbp:edgeWeight |
Euclidean distance
|
| gptkbp:hasSubgroup |
Delaunay triangulation
|
| https://www.w3.org/2000/01/rdf-schema#label |
Euclidean minimum spanning tree
|
| gptkbp:property |
unique if all distances are distinct
|
| gptkbp:relatedTo |
gptkb:geometry
gptkb:Gabriel_graph gptkb:relative_neighborhood_graph minimum spanning tree Euclidean graph |
| gptkbp:supportsAlgorithm |
gptkb:Kruskal's_algorithm
gptkb:Prim's_algorithm |
| gptkbp:usedIn |
gptkb:geographic_information_systems
data analysis image analysis |
| gptkbp:bfsParent |
gptkb:Euclide
gptkb:Gabriel_graph gptkb:relative_neighborhood_graph |
| gptkbp:bfsLayer |
7
|