scientific article; zbMATH DE number 1416198

MaRDI QIDQ4943373zbMATH OpenFDO

Authors Jean-François Hêche, Thomas M. Liebling

Publication date 16 March 2000

zbMATH Keywords

combinational optimizationcomputational geometryoptimal enclosuressimple polygons

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65D99) Combinatorial optimization (90C27)

Recommendations

• Triangle-Based Heuristics for Area Optimal Polygonizations
• Computing area-optimal simple polygonizations
• Greedy and local search heuristics to build area-optimal polygons
• Area optimal polygonization using simulated annealing
• Area-optimal simple polygonalizations: the CG challenge 2019

Cited in

(5)

• On polygons enclosing point sets
• An Algorithm to Compute Any Simple k-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
• Greedy and local search heuristics to build area-optimal polygons
• Area optimal polygonization using simulated annealing
• Triangle-Based Heuristics for Area Optimal Polygonizations

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