scientific article; zbMATH DE number 3854463

MaRDI QIDQ3323308zbMATH OpenFDO

Authors Herbert Edelsbrunner

Publication date 1983

zbMATH Keywords

binary searchconvex polygonsEuclidean planelower boundsmaximum distanceminimum distanceoptimal algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10) Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Recommendations

• Computing the extreme distances between two convex polygons
• Finding Extremal Polygons
• scientific article; zbMATH DE number 865984
• scientific article; zbMATH DE number 970811
• On distinct distances from a vertex of a convex polygon
• On distinct distances from a vertex of a convex polygon
• scientific article; zbMATH DE number 522850
• Extremal distances between sections of convex bodies
• On the extremal distance between two convex bodies
• On unit distances in a convex polygon

Cited in

(6)

• Finding the minimum vertex distance between two disjoint convex polygons in linear time
• Finding the closest extreme vertex to a fixed point
• Finding Extremal Polygons
• Computing the extreme distances between two convex polygons
• A linear time algorithm for the computation of some distance functions between convex polygons
• scientific article; zbMATH DE number 522850 (Why is no real title available?)

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 Q3323308)