Searching for empty convex polygons

DOI10.1007/BF01840404MaRDI QIDQ911758zbMATH OpenFDO

Authors David P. Dobkin, Mark H. Overmars, Herbert Edelsbrunner

Publication date 1990

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmscomputational geometrycombinatorial geometryempty convex subset

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4213490
• Counting convex polygons in planar point sets
• Finding sets of points without empty convex 6-gons
• Empty pseudo-triangles in point sets
• Three problems about simple polygons

Cites work

• scientific article; zbMATH DE number 3630765 (Why is no real title available?)
• scientific article; zbMATH DE number 1993586 (Why is no real title available?)
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Empty Simplices in Euclidean Space
• Konvexe Fünfecke in ebenen Punktmengen
• On Finding the Maxima of a Set of Vectors
• Sets with No Empty Convex 7-Gons
• The power of geometric duality
• Topologically sweeping an arrangement

Cited in

(12)

• Finding minimum area simple pentagons
• A combinatorial property on angular orders of plane point sets
• On empty convex polytopes
• Largest and smallest area triangles on imprecise points
• Recognition of largest empty orthoconvex polygon in a point set
• Empty squares in arbitrary orientation among points
• Faster counting empty convex polygons in a planar point set
• On a linear program for minimum-weight triangulation
• Every large point set contains many collinear points or an empty pentagon
• Starshaped sets
• The Erdos-Szekeres problem on points in convex position – a survey
• Finding minimum area \(k\)-gons

This page was built for publication: Searching for empty convex polygons

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