scientific article
From MaRDI portal
Publication:3969899
zbMath0503.68068MaRDI QIDQ3969899
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
diameterconvex hullVoronoi diagramspolygon decompositiondesign and analysis of algorithmsrelative neighborhood graphdistance between setsmerging two convex polygons
Pattern recognition, speech recognition (68T10) Discrete mathematics in relation to computer science (68R99)
Related Items
Sphere of influence graphs: Edge density and clique size ⋮ The expected size of some graphs in computational geometry ⋮ Complexity, convexity, and unimodality ⋮ Normal approximation in total variation for statistics in geometric probability ⋮ Convergence rate for geometric statistics of point processes having fast decay of dependence ⋮ SIG-dimension conjecture proved for graphs having a perfect matching ⋮ On the expected maximum degree of Gabriel and Yao graphs ⋮ In-place algorithms for computing a largest clique in geometric intersection graphs ⋮ Sphere of influence graphs and the \(L_{\infty}\)-metric ⋮ A linear time algorithm for obtaining the convex hull of a simple polygon ⋮ Sphere of influence graphs in general metric spaces ⋮ Finding the minimum vertex distance between two disjoint convex polygons in linear time
