You have seventeen identical unit regular pentagonal tiles on a tabletop. If you arrange them all into a single polyform (so each pentagon placed after the first shares a side with an already-placed pentagon, but no two pentagons overlap other than along their boundaries), what is the smallest nonzero distance you can create between two of the pentagons? Here, the distance between pentagon A and pentagon B is the infimum of the set of distances between any point of A and any point of B. Give your answer rounded to seven decimal places.

[As an example, if you only had four pentagons the answer would be ~0.5877853, from the arrangement pictured above.]