User:Man6506/Choose an Article

Article Selection
Please list articles that you're considering for your Wikipedia assignment below. Begin to critique these articles and find relevant sources.

Option 1
https://medium.com/@rockingrichie1994/what-is-neural-coding-263754e94b49 https://www.frontiersin.org/articles/10.3389/fncel.2017.00236/full
 * Neural Coding
 * Yes the article's content is relevant to the topic as it goes really in depth on what it is and how works. There are lot of various neural codings like rate coding, spike-count code, temporal coding and etc and it talks about on how each one works uniquely. I'd say that the citations are reliable because majority of the sources are documents that talk about neural coding. I think that the article tackles one of Wikipedia's equity gap.
 * https://training.incf.org/lesson/introduction-data-analysis-and-neural-coding
 * https://training.incf.org/lesson/introduction-data-analysis-and-neural-coding
 * https://training.incf.org/lesson/introduction-data-analysis-and-neural-coding

Option 2
https://www.geeksforgeeks.org/binary-space-partitioning/ https://web.cs.wpi.edu/~matt/courses/cs563/talks/bsp/document.html https://soulsphere.org/apocrypha/bsp/
 * Binary space partitioning
 * The article's content is relevant to the topic as it talks about what a binary space partitioning (BSP) is and how useful it is. It also talks about on how BSP can be used for rendering polygons through the use of canonical and how a BSP is traversed in a linear time. I'd say that the citations are reliable because the majority of the sources are presentations and documents provide information about BSP.
 * Sources
 * Sources
 * Sources

Option 3
https://www.cs.umd.edu/class/spring2020/cmsc754/Lects/lect10-dcel.pdf https://www.eecis.udel.edu/~elloyd/cisCG.d/JY_lect7.pdf
 * Doubly connected edge list
 * Yes the article's content is relevant to the topic as it talks about on doubly connected edge list is a data structure, how it works and that it is more than a doubly linked list of stages. It also talks about how it can be used in many algorithms of computational geometry and that it can be extended to handle disconnected graphs. I'd say the citations are reliable and that the article tackles one of Wikipedia's equity gap.
 * https://www2.cs.sfu.ca/~binay/813.2011/DCEL.pdf
 * https://www2.cs.sfu.ca/~binay/813.2011/DCEL.pdf
 * https://www2.cs.sfu.ca/~binay/813.2011/DCEL.pdf

Option 4

 * Article title
 * Article Evaluation
 * Sources
 * Sources
 * Sources

Option 5

 * Article title
 * Article Evaluation
 * Sources
 * Sources
 * Sources