Computational geometry column 58
Authors:
Open Access
- 10 December 2013
- journal article
- column
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 44 (4) , 73-78
Abstract
This column is devoted to opaque sets also known as barriers. A set of curves Γ that meet every line which intersects a given convex body B is called an opaque set or barrier for B . Although the shape and length of shortest barriers for simple bodies, such as a unit equilateral triangle or a unit square are seldom disputed, no proof of optimality is known or appears to be even near in sight.Keywords
This publication has 12 references indexed in Scilit:
- Optimal Shape DesignLecture Notes in Mathematics, 2000
- A counterexample to the algorithms for determining opaque minimal forestsInformation Processing Letters, 1991
- An O(n3) algorithm for finding the minimal opaque forest of a convex polygonInformation Processing Letters, 1988
- An algorithm for determining an opaque minimal forest of a convex polygonInformation Processing Letters, 1987
- The Shortest Curve that Meets all the Lines that Meet a Convex BodyThe American Mathematical Monthly, 1986
- On the shortest curve which meets all the lines which meet a circleAnnales Polonici Mathematici, 1984
- The Maximal Inradius of the Convex Cover of a Plane Connected set of Given LengthProceedings of the London Mathematical Society, 1982
- Curves Intersecting Certain Sets of Great-Circles on the SphereJournal of the London Mathematical Society, 1969
- Opaque Sets of Degree αThe American Mathematical Monthly, 1964
- Some opaque subsets of a square.The Michigan Mathematical Journal, 1959