This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
This article was reviewed by member(s) of WikiProject Articles for creation. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the project page for more information.Articles for creationWikipedia:WikiProject Articles for creationTemplate:WikiProject Articles for creationAfC articles
The article is written in clear, professional prose, and it appears to comply with the relevant sections of MoS. I have a couple of clarifications to request: in the section "Lower bound", I think "the expected number of intersections with the opaque set is at least " should maybe be "... is at least ", which would be, as the text says, "half that for " (). Am I missing something there? Also, maybe some sort of transition at the beginning of the second paragraph of that section could clarify that what follows is a second, alternate argument that half of the perimeter is a minimal value for the length of the barrier set. Also, there are at least a few calculated figures throughout that are missing "math" tags that should probably have them for stylistic consistency.
Typo fixed and purpose of second paragraph clarified. (It is not an alternative argument for the lower bound. It is an argument that the lower bound cannot be improved.) —David Eppstein (talk) 20:05, 16 November 2021 (UTC)Reply
Since I can't see past the first page of the Smart 1966 source, could you clarify its formulation of the problem (currently "painted walls in a glass house")? Is it something like "making a glass house opaque by raising some painted walls inside"? -Bryan Rutherford (talk) 16:42, 18 November 2021 (UTC)Reply
The article contains a reference section with numerous citations to reputable published sources. Some comments on the sources: Provan et al. seems to refer to the objects that are the topic of this article as "opaque covers"; should this alternate name be included in the lead section and first paragraph of "Definitions"? Then, in "Lower bound", I'm not finding the Crofton formula argument for half the perimeter being a minimal length for the barrier or the newly added explanation at the beginning of the second paragraph in Dumitrescu & Jiang; am I missing it? The claims are supported by the citations I can access, and there's no sign of inappropriate use of copyrighted material.
Alternative name added. In Dumitrescu & Jiang, the Crofton formula is the second-to-last sentence of page 3 (arxiv version): "For a planar convex body K, the measure of all lines that meet K is equal to per(K)." —David Eppstein (talk) 19:36, 17 November 2021 (UTC)Reply
The article appears to achieve broad coverage of the topic, with sections on the concept's definition, processes for establishing bounds for its length, algorithms for estimating optimal solutions, and the history of the topic and progress in studying it, together with a more niche section on curve-free opaque sets. It doesn't stray from the topic or omit any major aspects of it that occur to me.
The article takes a suitably neutral point of view on the topic, not exaggerating its significance or e.g. advocating for particular mathematicians or perspectives.
It is stable.
No edit wars, etc.:
The article is stable, with no major edits since before its nomination.
It is illustrated by images and other media, where possible and appropriate.
One final prose clarification, and I also wonder: should this article go into any other categories, like maybe Category:Discrete geometry (which the first sentence says is the field this topic most belongs to)? After these issues, I think we should be finished. -Bryan Rutherford (talk) 16:42, 18 November 2021 (UTC)Reply