Dear Cctbx community,<div><br></div><div>Firstly I'd like to say thank you to Rolf, Nicholas and Paul for their expertly thought through implementation of the reduced cell algorithm. I've found it to be extremely useful for my work.</div>
<div><br></div><div>My code is all in C++ and I'd like to be able to use the Krivy-Gruber algorithm. My understanding is that only the reduced (Buerger) unit cell algorithm is implemented in C++ [1] which guarantees shortest lengths but not unique angles. From my understanding the Krivy-Gruber would also guarantee me uniqueness of unit cell angles, however this is only implemented in Python [2]. Sorry to be so verbose, I just wanted to check that I was on the right page.</div>
<div><br></div><div>Would it be possible for me to implement the Krivy-Gruber in C++ by adding in the epsilon_relative to the parameter and following the procedure found in the python version?</div><div><br></div><div>Many thanks,</div>
<div>-Martin</div><div><br></div><div>[1] <a href="http://cctbx.sourceforge.net/current/c_plus_plus/classcctbx_1_1uctbx_1_1fast__minimum__reduction.html">http://cctbx.sourceforge.net/current/c_plus_plus/classcctbx_1_1uctbx_1_1fast__minimum__reduction.html</a></div>
<div>[2] <a href="http://cctbx.sourceforge.net/current/python/cctbx.uctbx.krivy_gruber_1976.html">http://cctbx.sourceforge.net/current/python/cctbx.uctbx.krivy_gruber_1976.html</a></div><div><br></div><div><br clear="all">
<div><br></div>-- <br><span style="border-collapse:collapse;color:rgb(136,136,136);font-family:arial,sans-serif;font-size:13px">Martin Uhrin Tel: +44 207 679 3466<br>Department of Physics & Astronomy Fax:+44 207 679 0595<br>
University College London <a href="mailto:martin.uhrin.10@ucl.ac.uk" style="color:rgb(0,0,204)" target="_blank">martin.uhrin.10@ucl.ac.uk</a><br>Gower St, London, WC1E 6BT, U.K. <a href="http://www.cmmp.ucl.ac.uk/" style="color:rgb(0,0,204)" target="_blank">http://www.cmmp.ucl.ac.uk</a></span><br>
</div>