scientific article; zbMATH DE number 3793444

zbMATH Open0503.68068MaRDI QIDQ3969899FDOQ3969899

Authors: Godfried Toussaint 

Publication date: 1982

Title of this publication is not available (Why is that?)

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

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)