How to quote a list from a paper?

Question

I'm writing a paper and I need to quote the following list: 1. Step1: Compute the center of each triangle and the correspondences between the center and three vertexes of the triangle; 2. Step2: Set up the Kd-tree according the centers of triangles; 3. Step3: Search the Kd-tree and check up the topological connectivity of the corresponding edges, and find the boundary edges; 4. Step4: Distinguish the different boundary loops according to the topological connectivity of vertexes; Do I quote like the following? " 1. Step1: Compute the center of each triangle and the correspondences between the center and three vertexes of the triangle; 2. Step2: Set up the Kd-tree according the centers of triangles; 3. Step3: Search the Kd-tree and check up the topological connectivity of the corresponding edges, and find the boundary edges; 4. Step4: Distinguish the different boundary loops according to the topological connectivity of vertexes; "(place citation number here)

Answer 1

Since this list is being directly quoted and not paraphrased, it would be formatted as a block quote, which does not require quotation marks (").

A signal phrase is included and is written first, as it serves as an introduction to the list and introduces the source.

Format the list as a single spaced block quote. Add the citation at the end of the block quote in parentheses. Since the last item on the list ends with a period, the citation is placed after the period. The citation contains the author's last name, year of publication, and page number.

If you add or change any words from the list, place brackets [ ] around those additions or changes.

Your passage will look like this (the signal phrase is underlined and bolded for emphasis only):

Smith developed the procedure to identify distinct boundary loops using the following steps:

Step 1: Compute the center of each triangle and the correspondences between the center and three vertices of the triangle.

Step 2: Set up the k-d tree according the centers of triangles.

Step 3: Search the k-d tree and check up the topological connectivity of the corresponding edges, and find the boundary edges.

Step 4: Distinguish the different boundary loops according to the topological connectivity of vertices. (Smith, 2015, p. 87)