4
$\begingroup$

Have these kinds of geometric spanning trees already been described?

enter image description here

all three are Minimum Spanning Trees of points that are elements of open disks, the only difference being in how the edge-weights are calculated:

  • the top tree is the ordinary MST with euclidean distance between the points resembling the vertices
  • the lower left uses the maximal angle, under which an edge is seen from the disks boundary
  • the lower right one uses the smaller of the local maxima of the angles under which an edge is seen from the disks boundary

The two lower trees are in some sense "orthogonal" to each other in that the edges of the left one "strive" for orthogonality to the boundary, whereas the edges of the right one "strive" for being parallel to the disks boundary and both trees "try" to accomplish that with "short" edges.

I can imagine, that a potential use could be in the tesselation of regions for use in finite elements methods.

$\endgroup$
  • $\begingroup$ Inside disks rather than circles... $\endgroup$ – YCor Mar 25 '18 at 14:59
  • 3
    $\begingroup$ @YCor depends on the interpretation of "inside"; if it is interpreted set theoretic in the sense of being an element of the set, then disks is correct. If interpreted geometrically, where the circle is the boundary of a finite region, then one might be tempted to say "inside the circle"; I guess it lies in the eye of the beholder, what seems more appropriate. $\endgroup$ – Manfred Weis Mar 25 '18 at 18:24
  • 2
    $\begingroup$ Actually what's useful in a universal mathematical language is that it does not depend on what's in the eye of the beholder. $\endgroup$ – YCor Mar 25 '18 at 19:48
  • 1
    $\begingroup$ There is no mistaking what was meant. One might substitute "interior to", as when mathematicians refer to an interior region and an exterior region in discussing the Jordan curve theorem. $\endgroup$ – Todd Trimble Mar 26 '18 at 10:33

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.