scientific article
From MaRDI portal
Publication:3716329
zbMath0588.68052MaRDI QIDQ3716329
Binay K. Bhattacharya, Godfried T. Toussaint
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
diameterconvex hullcomputational geometryminimum spanning circlemaximal spanning treeall-furthest-neighbor
Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)
Related Items
Fast algorithms for computing the diameter of a finite planar set ⋮ Complexity, convexity, and unimodality ⋮ Computing Euclidean maximum spanning trees ⋮ On the multimodality of distances in convex polygons ⋮ Computing largest empty circles with location constraints
