han.k

Hi Andre, The philosophy has been to keep the astap_cli version a pure solver. Secondly I was never so happy about the roundness measurement algorithm. This is pretty difficult for a star like object. But since unroundnes is also measurable by the HFD values, I would recommend to just use the HFD measurement: Analyse options: -analyse snr_min {Analyse only and report median HFD and number of stars used} To analyse a FITS file you could do in a Windows batch file the following: c:\astap.fpc\astap.exe...

Update, the problem lies not in the mount simulation but in the tiny difference in conversion between Jnow to J2000. The simulator works internally in J2000 because the databases are all in J2000. If the communication is in Jnow (standard for the simplest mounts), then Nina converts the J2000 position to Jnow before sending to the mount. Then in the simulator it is converted back to J2000. There will be tiny differences due to the formulas used. The simulator uses a very accurate rigorous method...

Update, the problem lies not in the mount simulation but in the tiny difference in conversion between Jnow to J2000. The simulator works internally in J2000 because the databases are all in J2000. If the communication is in Jnow (standard for the simplest mounts), then Nina converts the J2000 position to Jnow before sending to the mount. Then in the simulator it is converted back to J2000. There will be tiny differences due to the formulas used. The simulator uses a very accurate rigorous method...

I repeated your experiment. In Nina you always enters the coordinates in J2000. So the position reached is 1.5 RA arc second different and 10 arc second in DEC. That is not zero but almost nothing. Here it is a little less depending on the computer speed. . A star on an image will have a diameter of 3 to 4 arc seconds. So it is maybe 3 star diameters max. I assume with a real mount the mount driver will display exact the position but the real position the error will be much larger. I will see if...

Both ASTAP and ASTAP_CLI are now multi-threaded for blind solving. As a result blind solving is a few times faster. Joey Troy came with the first code modifications for this multi-threading solving. The code has been fine tuned and is now implemented. Clear skies, Han

Both ASTAP and ASTAP_CLI are now multi-threaded for blind solving. As a result blind solving is now a few times faster. Joey Troy came with the first code modifications for multi-threading solving. The code has been fine tuned and is now implemented. Clear skies, Han

ASTAP and ASTAP_CLI are both now multi-threaded for blind solving. So blind solving is a few times faster. Joey Troy came with the first code modifications for multi-threading solving. The code has been fine tuned and is now implemented. Clear skies, Han

'v2026.10.31'