Publication:3969899
From MaRDI portal
zbMath0503.68068MaRDI QIDQ3969899
Publication date: 1982
diameter; convex hull; Voronoi diagrams; polygon decomposition; design and analysis of algorithms; relative neighborhood graph; distance between sets; merging two convex polygons
68T10: Pattern recognition, speech recognition
68R99: Discrete mathematics in relation to computer science
Related Items
In-place algorithms for computing a largest clique in geometric intersection graphs, A linear time algorithm for obtaining the convex hull of a simple polygon, Finding the minimum vertex distance between two disjoint convex polygons in linear time, The expected size of some graphs in computational geometry, Sphere of influence graphs: Edge density and clique size, Sphere of influence graphs in general metric spaces, Sphere of influence graphs and the \(L_{\infty}\)-metric, SIG-dimension conjecture proved for graphs having a perfect matching, Complexity, convexity, and unimodality, On the expected maximum degree of Gabriel and Yao graphs