A=20 sections=20 with_hit=0 hits=0 t=4s
A=20 sections=40 with_hit=0 hits=0 t=8s
A=20 sections=60 with_hit=0 hits=0 t=12s
A=20 sections=80 with_hit=0 hits=0 t=16s
A=20 sections=100 with_hit=0 hits=0 t=20s
A=20 sections=120 with_hit=0 hits=0 t=24s
A=20 sections=140 with_hit=0 hits=0 t=28s
A=20 sections=160 with_hit=0 hits=0 t=32s
A=20 sections=180 with_hit=0 hits=0 t=36s
Traceback (most recent call last):
  File "[local folder]/search_sections.py", line 228, in <module>
    main()
    ~~~~^^
  File "[local folder]/search_sections.py", line 216, in main
    hits, npts = process(a, fout)
                 ~~~~~~~^^^^^^^^^
  File "[local folder]/search_sections.py", line 168, in process
    tri = Delaunay(X)
  File "scipy/spatial/_qhull.pyx", line 1889, in scipy.spatial._qhull.Delaunay.__init__
  File "scipy/spatial/_qhull.pyx", line 357, in scipy.spatial._qhull._Qhull.__init__
scipy.spatial._qhull.QhullError: QH6154 Qhull precision error: Initial simplex is flat (facet 1 is coplanar with the interior point)

While executing:  | qhull d Qbb Qz Qc Q12 Qx Qt
Options selected for Qhull 2020.2.r 2020/08/31:
  run-id 1310149369  delaunay  Qbbound-last  Qz-infinity-point  Qcoplanar-keep
  Q12-allow-wide  Qxact-merge  Qtriangulate  _zero-centrum  Qinterior-keep
  Pgood  _max-width 7.1  Error-roundoff 1.2e-14  _one-merge 1.6e-13
  Visible-distance 7.5e-14  U-max-coplanar 7.5e-14  Width-outside 1.5e-13
  _wide-facet 4.5e-13  _maxoutside 1.7e-13

precision problems (corrected unless 'Q0' or an error)
      7 nearly singular or axis-parallel hyperplanes

The input to qhull appears to be less than 6 dimensional, or a
computation has overflowed.

Qhull could not construct a clearly convex simplex from points:
- p141(v7):     0     0     0     0     0     0
- p256(v6):  -1.4 -0.63   3.4  -1.5 -1.7e-16   3.2
- p265(v5):   1.4  -1.3    -1  -3.1     0   2.8
- p255(v4):     0 -0.63   3.4  -1.5 -3.3e-16   2.8
- p153(v3):  0.71   3.5   1.5 2.8e-16 -2.8e-16     3
- p56(v2):   3.5 -0.32 -0.26   1.5 1.7e-16     3
- p61(v1):  -3.5 -0.32 -0.26   1.5     0     3

The center point is coplanar with a facet, or a vertex is coplanar
with a neighboring facet.  The maximum round off error for
computing distances is 1.2e-14.  The center point, facets and distances
to the center point are as follows:

center point    0.101  0.04518    0.959  -0.4364 -8.723e-17    2.554

facet p256 p265 p255 p153 p56 p61 distance= -2.1e-16
facet p141 p265 p255 p153 p56 p61 distance= -2.9e-17
facet p141 p256 p255 p153 p56 p61 distance= -8.5e-16
facet p141 p256 p265 p153 p56 p61 distance= -2.9e-17
facet p141 p256 p265 p255 p56 p61 distance= -1.4e-15
facet p141 p256 p265 p255 p153 p61 distance= -1.7e-16
facet p141 p256 p265 p255 p153 p56 distance= -1.2e-16

These points either have a maximum or minimum x-coordinate, or
they maximize the determinant for k coordinates.  Trial points
are first selected from points that maximize a coordinate.

The min and max coordinates for each dimension are:
  0:    -3.536     3.536  difference= 7.071
  1:    -3.479     3.479  difference= 6.957
  2:    -3.357     3.357  difference= 6.713
  3:    -3.055     3.055  difference= 6.11
  4:  -4.441e-16  4.441e-16  difference= 8.882e-16
  5:         0     3.536  difference= 3.536

If the input should be full dimensional, you have several options that
may determine an initial simplex:
  - use 'QJ'  to joggle the input and make it full dimensional
  - use 'QbB' to scale the points to the unit cube
  - use 'QR0' to randomly rotate the input for different maximum points
  - use 'Qs'  to search all points for the initial simplex
  - use 'En'  to specify a maximum roundoff error less than 1.2e-14.
  - trace execution with 'T3' to see the determinant for each point.

If the input is lower dimensional:
  - use 'QJ' to joggle the input and make it full dimensional
  - use 'Qbk:0Bk:0' to delete coordinate k from the input.  You should
    pick the coordinate with the least range.  The hull will have the
    correct topology.
  - determine the flat containing the points, rotate the points
    into a coordinate plane, and delete the other coordinates.
  - add one or more points to make the input full dimensional.

