scientific article; zbMATH DE number 1416198

zbMATH Open0960.90530MaRDI QIDQ4943373FDOQ4943373

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

Publication date: 16 March 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

computational geometrysimple polygonscombinational optimizationoptimal enclosures

Mathematics Subject Classification ID

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

Cited In (5)

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

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)