OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Rectilinear minimum spanning tree

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Spanning tree
 0 By others on same topic  0 Discussions  1970-01-01  See my version
A Rectilinear Minimum Spanning Tree (RMST) is a specific type of minimum spanning tree that is defined in a rectilinear (or grid-like) space, where the coordinates are aligned with the axes of a Cartesian plane. In a rectilinear geometry, the distance between two points is measured using the Manhattan distance (also known as the L1 distance), which is calculated as the sum of the absolute differences of their Cartesian coordinates.

 Ancestors (6)

  1. Spanning tree
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook