scientific article; zbMATH DE number 3793444

MaRDI QIDQ3969899zbMATH OpenFDO

Authors Godfried Toussaint

Publication date 1982

zbMATH Keywords

convex hulldesign and analysis of algorithmsdiameterdistance between setsmerging two convex polygonspolygon decompositionrelative neighborhood graphVoronoi diagrams

Mathematics Subject Classification ID

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

Cited in

(14)

• 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
• \(\mathrm{SIG}\)-dimension conjecture proved for graphs having a perfect matching
• Complexity, convexity, and unimodality
• On the expected maximum degree of Gabriel and Yao graphs
• Normal approximation in total variation for statistics in geometric probability
• Convergence rate for geometric statistics of point processes having fast decay of dependence
• Minimum convex partition of a polygon with holes by cuts in given directions
• Minimum star partitions of simple polygons in polynomial time
• In-place algorithms for computing a largest clique in geometric intersection graphs

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)