Searching for empty convex polygons

DOI10.1007/BF01840404zbMATH Open0697.68034MaRDI QIDQ911758FDOQ911758

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

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• scientific article
• 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

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)

Cites Work

• The power of geometric duality
• On Finding the Maxima of a Set of Vectors
• Empty Simplices in Euclidean Space
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Topologically sweeping an arrangement
• Konvexe Fünfecke in ebenen Punktmengen
• Sets with No Empty Convex 7-Gons
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

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

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)