scientific article; zbMATH DE number 3793444

MaRDI QIDQ3969899zbMATH OpenFDO

Authors Godfried Toussaint

Publication date 1982

zbMATH Keywords

convex hulldiameterVoronoi diagramsdesign and analysis of algorithmspolygon decompositionrelative neighborhood graphdistance between setsmerging two convex polygons

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Discrete mathematics in relation to computer science (68R99)

Cited in

(13)

• Sphere of influence graphs: Edge density and clique size
• Sphere of influence graphs and the \(L_{\infty}\)-metric
• In-place algorithms for computing a largest clique in geometric intersection graphs
• Finding the minimum vertex distance between two disjoint convex polygons in linear time
• Minimum convex partition of a polygon with holes by cuts in given directions
• Complexity, convexity, and unimodality
• A linear time algorithm for obtaining the convex hull of a simple polygon
• Sphere of influence graphs in general metric spaces
• Convergence rate for geometric statistics of point processes having fast decay of dependence
• \(\mathrm{SIG}\)-dimension conjecture proved for graphs having a perfect matching
• The expected size of some graphs in computational geometry
• On the expected maximum degree of Gabriel and Yao graphs
• Normal approximation in total variation for statistics in geometric probability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3969899)