Table XI.

Running Times (in Seconds) of the ASAP Algorithm on the SQUARE Graph with n = {10³, 10⁴, 10⁵} Nodes inside the Unit Square, η = 0% and deg ≈ 12, 13

Stage \# of nodes n	1,000	10,000	100,000
Break G into patches	41	901	52,180
Embedding patches	414	4,325	37,140
Patch intersections	2	132	58,134
Build $\mathcal{Z}$	8.7	90	2,237
Compute $v_1^{\mathcal{Z}}$	0.8	13	926
Build $\mathcal{R}$	4.6	49	3,414
Compute $v_1^{\mathcal{R}}$	0.2	7	522
Step 3	6	88	4,772
Total Time (sec)	477	5,605	159,325