Maximum spanning trees in normed planes

DOI10.1007/s00373-021-02325-6zbMath1480.46021OpenAlexW3163136652MaRDI QIDQ2042214

Javier Alonso, Pedro Martín Jiménez

Publication date: 28 July 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02325-6

zbMATH Keywords

normed planemaximum spanning tree

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Graph theory (including graph drawing) in computer science (68R10) Geometry and structure of normed linear spaces (46B20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (2) dimensions (including convex curves) (52A10) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21)

Cites Work

• Unnamed Item
• Randomized incremental construction of abstract Voronoi diagrams
• Computing Euclidean maximum spanning trees
• Stabbing line segments
• Concrete and abstract Voronoi diagrams
• Geometric clustering in normed planes
• Three-clustering of points in the plane.
• FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
• On Bisectors in Normed Spaces
• The geometry of Minkowski spaces -- a survey. I

This page was built for publication: Maximum spanning trees in normed planes