This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computer graphics Low‑importance This article is within the scope of WikiProject Computer graphics, a collaborative effort to improve the coverage of computer graphics 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.Computer graphicsWikipedia:WikiProject Computer graphicsTemplate:WikiProject Computer graphicscomputer graphics articles Low This article has been rated as Low-importance on the project's importance scale. project-independent quality rating in the banner shell. Please resolve this conflict if possible. ??? This article has not yet received a rating on the project's importance scale. This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the |auto= parameter.

Algorithms

First, this section has essentially no citations, which I'm going to flag after updating the talk page. 73.217.103.80 (talk) 00:26, 8 January 2024 (UTC)[reply]

The given algorithm makes no sense. It does not express what p is meant to do as a parameter. At the second step it states, "Search 8 locations +/- S pixels around location (0,0) and the location (0,0)", which is redundant to the point that I believe it was supposed to express something different (and therefore lacking crucial information). Even ignoring the probably erroneous redundancy, it doesn't express how the 8 locations are resolved (each could be be chosen along a circle, as a diamond, as a large square, etc). The rest of it makes reasonable sense, but those few issues are clearly pretty critical. 73.217.103.80 (talk) 00:26, 8 January 2024 (UTC)[reply]