Searching for empty convex polygons

DOI10.1007/BF01840404zbMath0697.68034MaRDI QIDQ911758

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

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmscombinatorial geometrycomputational geometryempty convex subset

Mathematics Subject Classification ID

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

Related Items

A combinatorial property on angular orders of plane point sets, Empty squares in arbitrary orientation among points, Starshaped sets, Every large point set contains many collinear points or an empty pentagon, Finding minimum area \(k\)-gons, Largest and smallest area triangles on imprecise points, Finding minimum area simple pentagons, Faster counting empty convex polygons in a planar point set, Unnamed Item, The Erdos-Szekeres problem on points in convex position – a survey

Cites Work

• The power of geometric duality
• Topologically sweeping an arrangement
• Konvexe Fünfecke in ebenen Punktmengen
• Sets with No Empty Convex 7-Gons
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Empty Simplices in Euclidean Space
• On Finding the Maxima of a Set of Vectors
• Unnamed Item
• Unnamed Item