Algorithm 966

DOI10.1145/2890491zbMath1368.68307OpenAlexW2510258722WikidataQ113310198 ScholiaQ113310198MaRDI QIDQ5270778

Pedro J. de Rezende, Davi C. Tozoni, Cid Carvalho De Souza

Publication date: 30 June 2017

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2890491

zbMATH Keywords

combinatorial optimizationcomputational geometryart gallery problemexact algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packaged methods for numerical algorithms (65Y15)

Related Items (6)

Solving the minimum convex partition of point sets with integer programming ⋮ Algorithms for art gallery illumination ⋮ Optimal deterministic algorithm generation ⋮ Topological art in simple galleries ⋮ Facets for art gallery problems ⋮ Algorithm 966

Uses Software

• CGAL
• GLPK
• XPRESS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nearly optimal algorithm for covering the interior of an art gallery
• Facets for art gallery problems
• Approximation algorithms for art gallery problems in polygons
• Efficient visibility queries in simple polygons
• LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
• Computational complexity of art gallery problems
• An exact algorithm for minimizing vertex guards on art galleries
• Exact solutions and bounds for general art gallery problems
• Visibility Algorithms in the Plane
• GUARDING ART GALLERIES BY GUARDING WITNESSES

This page was built for publication: Algorithm 966