An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon

DOI10.1016/0020-0190(88)90122-6zbMath0662.68040OpenAlexW2058215634MaRDI QIDQ1114398

Pratul Dublish

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90122-6

zbMATH Keywords

convex polygoncomputational geometryminimal opaque forest

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (6)

Optimization of a subclass of conjunctive queries ⋮ Improving the lower bound on opaque sets for equilateral triangle ⋮ A counterexample to the algorithms for determining opaque minimal forests ⋮ Opaque sets ⋮ Opaque Sets ⋮ Computing Opaque Interior Barriers à la Shermer

Cites Work

• An algorithm for determining an opaque minimal forest of a convex polygon

This page was built for publication: An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon