scientific article; zbMATH DE number 4213490

MaRDI QIDQ3359792zbMATH OpenFDO

Authors Amitava Datta, G. D. S. Ramkumar

Publication date 1990

zbMATH Keywords

geometric optimization problemslargest empty ortho-convex isothetic polygon problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On empty convex polygons in a planar point set
• On empty convex polygons in a planar point set
• Recognition of largest empty orthoconvex polygon in a point set
• Large empty convex polygons in \(k\)-convex sets
• Empty convex polygons in almost convex sets
• On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons
• A sufficient condition for the existence of large empty convex polygons
• scientific article; zbMATH DE number 881170
• Disjoint empty convex polygons in planar point sets

Cited in

(7)

• Linear-size planar Manhattan network for convex point sets
• Recognition of largest empty orthoconvex polygon in a point set
• The orthogonal convex skull problem
• Searching for empty convex polygons
• Maximum rectilinear convex subsets
• On finding an empty staircase polygon of largest area (width) in a planar point-set
• On empty convex polytopes

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