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

DOI10.1016/0020-0190(87)90185-2zbMath0653.68030OpenAlexW1974114050WikidataQ57699720 ScholiaQ57699720MaRDI QIDQ1107998

Varol Akman

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90185-2

zbMATH Keywords

triangulationconvex polygoncomputational geometryminimum spanning treeSteiner treeopaque 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

Improving the lower bound on opaque sets for equilateral triangle, An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon, A counterexample to the algorithms for determining opaque minimal forests, Opaque sets, Opaque Sets, Computing Opaque Interior Barriers à la Shermer

Cites Work

• Steiner Minimal Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item