1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142
|
/*** File libwcs/sortstar.c
*** June 24, 2016
*** By Jessica Mink, jmink@cfa.harvard.edu
*** Harvard-Smithsonian Center for Astrophysics
*** Copyright (C) 1996-2016
*** Smithsonian Astrophysical Observatory, Cambridge, MA, USA
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Correspondence concerning WCSTools should be addressed as follows:
Internet email: jmink@cfa.harvard.edu
Postal address: Jessica Mink
Smithsonian Astrophysical Observatory
60 Garden St.
Cambridge, MA 02138 USA
*/
/* void FluxSortStars() Sort star list based on brightness
* int StarFluxSort() Return brightest of two stars based on flux
* void MagSortStars() Sort stars list based on magnitude
* int StarMagSort() Return brightest of two stars based on mag.
* void RASortStars() Sort stars based on right ascension
* int StarRASort() Return star with lowest right ascension
* void DecSortStars() Sort stars based on declination
* int StarDecSort() Return star with lowest declination
* void IDSortStars() Sort stars based on ID number
* int StarIDSort() Return star with lowest ID number
* void XSortStars() Sort stars based on X coordinate in image
* int StarXSort() Return star with lowest X coordinate
* void YSortStars() Sort stars based on Y coordinate in image
* int StarYSort() Return star with lowest Y coordinate
* int MergeStars() Merge multiple entries within given radius
* int StarMerge() Merge stars, called by MergeStars()
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "wcs.h"
#include "fitsfile.h"
#include "wcscat.h"
/* structure for star lists needed for sorting */
typedef struct {
double n; /* Identifying number */
double ra; /* Right Ascension */
double dec; /* Declination */
double pra; /* Right Ascension proper motion */
double pdec; /* Declination proper motion */
double m[MAXNMAG+1]; /* Magnitude */
double b; /* flux */
double x; /* Image X coordinate */
double y; /* Image Y coordinate */
int c; /* Other 4-byte information */
char *obj; /* Object name */
} StarInfo;
/* Sort image stars by decreasing flux */
void
FluxSortStars (sx, sy, sb, sc, ns)
double *sx;
double *sy;
double *sb;
int *sc;
int ns;
{
StarInfo *stars;
int StarFluxSort ();
int i;
stars = (StarInfo *) calloc ((unsigned int)ns, sizeof(StarInfo));
for (i = 0; i < ns; i++) {
stars[i].x = sx[i];
stars[i].y = sy[i];
stars[i].b = sb[i];
stars[i].c = sc[i];
}
qsort ((char *)stars, ns, sizeof(StarInfo), StarFluxSort);
for (i = 0; i < ns; i++) {
sx[i] = stars[i].x;
sy[i] = stars[i].y;
sb[i] = stars[i].b;
sc[i] = stars[i].c;
}
free ((char *)stars);
return;
}
/* StarFluxSort -- Order stars in decreasing flux called by qsort */
int
StarFluxSort (ssp1, ssp2)
void *ssp1, *ssp2;
{
double b1 = ((StarInfo *)ssp1)->b;
double b2 = ((StarInfo *)ssp2)->b;
if (b2 > b1)
return (1);
else if (b2 < b1)
return (-1);
else
return (0);
}
/* MagSortStars -- Sort image stars by increasing magnitude */
static int magsort = 0;
void
MagSortStars (sn, sra, sdec, spra, spdec, sx, sy, sm, sc, sobj, ns, nm, ms)
double *sn; /* Identifying number */
double *sra; /* Right Ascension */
double *sdec; /* Declination */
double *spra; /* Right Ascension proper motion */
double *spdec; /* Declination proper motion */
double *sx; /* Image X coordinate */
double *sy; /* Image Y coordinate */
double **sm; /* Magnitudes */
int *sc; /* Other 4-byte information */
char **sobj; /* Object name */
int ns; /* Number of stars to sort */
int nm; /* Number of magnitudes per star */
int ms; /* Magnitude by which to sort (1 to nmag) */
{
StarInfo *stars;
int i, j, hasnum, haspos, hasobj, haspm, hasxy;
int StarMagSort();
stars = (StarInfo *) calloc ((unsigned int)ns, sizeof(StarInfo));
if (ms > 0 && ms <= nm)
magsort = ms - 1;
if (sn == NULL)
hasnum = 0;
else
hasnum = 1;
if (sra != NULL && sdec != NULL)
haspos = 1;
else
haspos = 0;
if (spra != NULL && spdec != NULL)
haspm = 1;
else
haspm = 0;
if (sx != NULL && sy != NULL)
hasxy = 1;
else
hasxy = 0;
if (sobj == NULL)
hasobj = 0;
else
hasobj = 1;
for (i = 0; i < ns; i++) {
if (hasnum)
stars[i].n = sn[i];
if (haspos) {
stars[i].ra = sra[i];
stars[i].dec = sdec[i];
}
if (haspm) {
stars[i].pra = spra[i];
stars[i].pdec = spdec[i];
}
if (hasxy) {
stars[i].x = sx[i];
stars[i].y = sy[i];
}
for (j = 0; j < nm; j++)
stars[i].m[j] = sm[j][i];
stars[i].c = sc[i];
if (hasobj)
stars[i].obj = sobj[i];
}
qsort ((char *)stars, ns, sizeof(StarInfo), StarMagSort);
for (i = 0; i < ns; i++) {
if (hasnum)
sn[i] = stars[i].n;
if (haspos) {
sra[i] = stars[i].ra;
sdec[i] = stars[i].dec;
}
if (haspm) {
spra[i] = stars[i].pra;
spdec[i] = stars[i].pdec;
}
if (hasxy) {
sx[i] = stars[i].x;
sy[i] = stars[i].y;
}
for (j = 0; j < nm; j++)
sm[j][i] = stars[i].m[j];
sc[i] = stars[i].c;
if (hasobj)
sobj[i] = stars[i].obj;
}
free ((char *)stars);
return;
}
/* StarMagSort -- Order stars in decreasing flux called by qsort */
int
StarMagSort (ssp1, ssp2)
void *ssp1, *ssp2;
{
double b1 = ((StarInfo *)ssp1)->m[magsort];
double b2 = ((StarInfo *)ssp2)->m[magsort];
/* If sort magnitude is not set, check the others until one is found */
if (b1 > 100.0)
b1 = b1 - 100.0;
if (b1 == 99.90)
b1 = ((StarInfo *)ssp1)->m[0];
if (b1 == 99.90)
b1 = ((StarInfo *)ssp1)->m[1];
if (b1 == 99.90)
b1 = ((StarInfo *)ssp1)->m[2];
if (b1 == 99.90)
b1 = ((StarInfo *)ssp1)->m[3];
/* If sort magnitude is not set, check the others until one is found */
if (b2 > 100.0)
b2 = b2 - 100.0;
if (b2 == 99.90)
b2 = ((StarInfo *)ssp2)->m[0];
if (b2 == 99.90)
b2 = ((StarInfo *)ssp2)->m[1];
if (b2 == 99.90)
b2 = ((StarInfo *)ssp2)->m[2];
if (b2 == 99.90)
b2 = ((StarInfo *)ssp2)->m[3];
if (b2 < b1)
return (1);
else if (b2 > b1)
return (-1);
else
return (0);
}
/* IDSortStars -- Sort image stars by increasing ID Number value */
void
IDSortStars (sn, sra, sdec, spra, spdec, sx, sy, sm, sc, sobj, ns, nm)
double *sn; /* Identifying number */
double *sra; /* Right Ascension */
double *sdec; /* Declination */
double *spra; /* Right Ascension proper motion */
double *spdec; /* Declination proper motion */
double *sx; /* Image X coordinate */
double *sy; /* Image Y coordinate */
double **sm; /* Magnitudes */
int *sc; /* Other 4-byte information */
char **sobj; /* Object name */
int ns; /* Number of stars to sort */
int nm; /* Number of magnitudes per star */
{
StarInfo *stars;
int i, j, hasnum, hasobj, haspos, haspm, hasxy;
int StarIDSort ();
stars = (StarInfo *) calloc ((unsigned int)ns, sizeof(StarInfo));
if (sn == NULL)
return;
else
hasnum = 1;
if (sra != NULL && sdec != NULL)
haspos = 1;
else
haspos = 0;
if (spra != NULL && spdec != NULL)
haspm = 1;
else
haspm = 0;
if (sobj == NULL)
hasobj = 0;
else
hasobj = 1;
if (sx != NULL && sy != NULL)
hasxy = 1;
else
hasxy = 0;
for (i = 0; i < ns; i++) {
if (hasnum)
stars[i].n = sn[i];
if (haspos) {
stars[i].ra = sra[i];
stars[i].dec = sdec[i];
}
if (haspm) {
stars[i].pra = spra[i];
stars[i].pdec = spdec[i];
}
if (hasxy) {
stars[i].x = sx[i];
stars[i].y = sy[i];
}
for (j = 0; j < nm; j++)
stars[i].m[j] = sm[j][i];
stars[i].c = sc[i];
if (hasobj)
stars[i].obj = sobj[i];
}
qsort ((char *)stars, ns, sizeof(StarInfo), StarIDSort);
for (i = 0; i < ns; i++) {
if (hasnum)
sn[i] = stars[i].n;
if (haspos) {
sra[i] = stars[i].ra;
sdec[i] = stars[i].dec;
}
if (haspm) {
spra[i] = stars[i].pra;
spdec[i] = stars[i].pdec;
}
if (hasxy) {
sx[i] = stars[i].x;
sy[i] = stars[i].y;
}
for (j = 0; j < nm; j++)
sm[j][i] = stars[i].m[j];
sc[i] = stars[i].c;
if (hasobj)
sobj[i] = stars[i].obj;
}
free ((char *)stars);
return;
}
/* StarIDSort -- Order stars in increasing ID value called by qsort */
int
StarIDSort (ssp1, ssp2)
void *ssp1, *ssp2;
{
double n1 = ((StarInfo *)ssp1)->n;
double n2 = ((StarInfo *)ssp2)->n;
if (n2 < n1)
return (1);
else if (n2 > n1)
return (-1);
else
return (0);
}
/* Sort image stars by increasing right ascension */
void
RASortStars (sn, sra, sdec, spra, spdec, sx, sy, sm, sc, sobj, ns, nm)
double *sn; /* Identifying number */
double *sra; /* Right Ascension */
double *sdec; /* Declination */
double *spra; /* Right Ascension proper motion */
double *spdec; /* Declination proper motion */
double *sx; /* Image X coordinate */
double *sy; /* Image Y coordinate */
double **sm; /* Magnitudes */
int *sc; /* Other 4-byte information */
char **sobj; /* Object name */
int ns; /* Number of stars to sort */
int nm; /* Number of magnitudes per star */
{
StarInfo *stars;
int i, j, hasnum, hasobj, haspm, hasxy;
int StarRASort();
stars = (StarInfo *) calloc ((unsigned int)ns, sizeof(StarInfo));
if (sn == NULL)
hasnum = 0;
else
hasnum = 1;
if (spra != NULL && spdec != NULL)
haspm = 1;
else
haspm = 0;
if (sx != NULL && sy != NULL)
hasxy = 1;
else
hasxy = 0;
if (sobj == NULL)
hasobj = 0;
else
hasobj = 1;
for (i = 0; i < ns; i++) {
if (hasnum)
stars[i].n = sn[i];
stars[i].ra = sra[i];
stars[i].dec = sdec[i];
if (haspm) {
stars[i].pra = spra[i];
stars[i].pdec = spdec[i];
}
if (hasxy) {
stars[i].x = sx[i];
stars[i].y = sy[i];
}
for (j = 0; j < nm; j++)
stars[i].m[j] = sm[j][i];
stars[i].c = sc[i];
if (hasobj)
stars[i].obj = sobj[i];
}
qsort ((char *)stars, ns, sizeof(StarInfo), StarRASort);
for (i = 0; i < ns; i++) {
if (hasnum)
sn[i] = stars[i].n;
sra[i] = stars[i].ra;
sdec[i] = stars[i].dec;
if (haspm) {
spra[i] = stars[i].pra;
spdec[i] = stars[i].pdec;
}
if (hasxy) {
sx[i] = stars[i].x;
sy[i] = stars[i].y;
}
for (j = 0; j < nm; j++)
sm[j][i] = stars[i].m[j];
sc[i] = stars[i].c;
if (hasobj)
sobj[i] = stars[i].obj;
}
free ((char *)stars);
return;
}
/* Order stars in increasing right ascension (called by qsort) */
int
StarRASort (ssp1, ssp2)
const void *ssp1, *ssp2;
{
double ra1 = ((StarInfo *)ssp1)->ra;
double ra2 = ((StarInfo *)ssp2)->ra;
if (ra2 > ra1)
return (-1);
else if (ra2 < ra1)
return (1);
else
return (0);
}
/* Sort image stars by increasing declination */
void
DecSortStars (sn, sra, sdec, spra, spdec, sx, sy, sm, sc, sobj, ns, nm)
double *sn; /* Identifying number */
double *sra; /* Right Ascension */
double *sdec; /* Declination */
double *spra; /* Right Ascension proper motion */
double *spdec; /* Declination proper motion */
double *sx; /* Image X coordinate */
double *sy; /* Image Y coordinate */
double **sm; /* Magnitudes */
int *sc; /* Other 4-byte information */
char **sobj; /* Object name */
int ns; /* Number of stars to sort */
int nm; /* Number of magnitudes per star */
{
StarInfo *stars;
int i, j, hasnum, hasobj, haspm, hasxy;
int StarDecSort ();
stars = (StarInfo *) calloc ((unsigned int)ns, sizeof(StarInfo));
if (sn == NULL)
hasnum = 0;
else
hasnum = 1;
if (spra != NULL && spdec != NULL)
haspm = 1;
else
haspm = 0;
if (sx != NULL && sy != NULL)
hasxy = 1;
else
hasxy = 0;
if (sobj == NULL)
hasobj = 0;
else
hasobj = 1;
for (i = 0; i < ns; i++) {
if (hasnum)
stars[i].n = sn[i];
stars[i].ra = sra[i];
stars[i].dec = sdec[i];
if (haspm) {
stars[i].pra = spra[i];
stars[i].pdec = spdec[i];
}
if (hasxy) {
stars[i].x = sx[i];
stars[i].y = sy[i];
}
for (j = 0; j < nm; j++)
stars[i].m[j] = sm[j][i];
stars[i].c = sc[i];
if (hasobj)
stars[i].obj = sobj[i];
}
qsort ((char *)stars, ns, sizeof(StarInfo), StarDecSort);
for (i = 0; i < ns; i++) {
if (hasnum)
sn[i] = stars[i].n;
sra[i] = stars[i].ra;
sdec[i] = stars[i].dec;
if (haspm) {
spra[i] = stars[i].pra;
spdec[i] = stars[i].pdec;
}
if (hasxy) {
sx[i] = stars[i].x;
sy[i] = stars[i].y;
}
for (j = 0; j < nm; j++)
sm[j][i] = stars[i].m[j];
sc[i] = stars[i].c;
if (hasobj)
sobj[i] = stars[i].obj;
}
free ((char *)stars);
return;
}
/* Order stars in increasing declination (called by qsort) */
int
StarDecSort (ssp1, ssp2)
void *ssp1, *ssp2;
{
double dec1 = ((StarInfo *)ssp1)->dec;
double dec2 = ((StarInfo *)ssp2)->dec;
if (dec2 > dec1)
return (-1);
else if (dec2 < dec1)
return (1);
else
return (0);
}
/* XSortStars -- Sort image stars by increasing X value */
void
XSortStars (sn, sra, sdec, spra, spdec, sx, sy, sm, sc, sobj, ns, nm)
double *sn; /* Identifying number */
double *sra; /* Right Ascension */
double *sdec; /* Declination */
double *spra; /* Right Ascension proper motion */
double *spdec; /* Declination proper motion */
double *sx; /* Image X coordinate */
double *sy; /* Image Y coordinate */
double **sm; /* Magnitudes */
int *sc; /* Other 4-byte information */
char **sobj; /* Object name */
int ns; /* Number of stars to sort */
int nm; /* Number of magnitudes per star */
{
StarInfo *stars;
int i, j, hasnum, hasobj, haspos, haspm;
int StarXSort ();
stars = (StarInfo *) calloc ((unsigned int)ns, sizeof(StarInfo));
if (sn == NULL)
hasnum = 0;
else
hasnum = 1;
if (sra != NULL && sdec != NULL)
haspos = 1;
else
haspos = 0;
if (spra != NULL && spdec != NULL)
haspm = 1;
else
haspm = 0;
if (sobj == NULL)
hasobj = 0;
else
hasobj = 1;
for (i = 0; i < ns; i++) {
if (hasnum)
stars[i].n = sn[i];
if (haspos) {
stars[i].ra = sra[i];
stars[i].dec = sdec[i];
}
if (haspm) {
stars[i].pra = spra[i];
stars[i].pdec = spdec[i];
}
stars[i].x = sx[i];
stars[i].y = sy[i];
for (j = 0; j < nm; j++)
stars[i].m[j] = sm[j][i];
stars[i].c = sc[i];
if (hasobj)
stars[i].obj = sobj[i];
}
qsort ((char *)stars, ns, sizeof(StarInfo), StarXSort);
for (i = 0; i < ns; i++) {
if (hasnum)
sn[i] = stars[i].n;
if (haspos) {
sra[i] = stars[i].ra;
sdec[i] = stars[i].dec;
}
if (haspm) {
spra[i] = stars[i].pra;
spdec[i] = stars[i].pdec;
}
sx[i] = stars[i].x;
sy[i] = stars[i].y;
for (j = 0; j < nm; j++)
sm[j][i] = stars[i].m[j];
sc[i] = stars[i].c;
if (hasobj)
sobj[i] = stars[i].obj;
}
free ((char *)stars);
return;
}
/* StarXSort -- Order stars in decreasing X value called by qsort */
int
StarXSort (ssp1, ssp2)
void *ssp1, *ssp2;
{
double x1 = ((StarInfo *)ssp1)->x;
double x2 = ((StarInfo *)ssp2)->x;
if (x2 < x1)
return (1);
else if (x2 > x1)
return (-1);
else
return (0);
}
/* YSortStars -- Sort image stars by increasing Y value */
void
YSortStars (sn, sra, sdec, spra, spdec, sx, sy, sm, sc, sobj, ns, nm)
double *sn; /* Identifying number */
double *sra; /* Right Ascension */
double *sdec; /* Declination */
double *spra; /* Right Ascension proper motion */
double *spdec; /* Declination proper motion */
double *sx; /* Image X coordinate */
double *sy; /* Image Y coordinate */
double **sm; /* Magnitudes */
int *sc; /* Other 4-byte information */
char **sobj; /* Object name */
int ns; /* Number of stars to sort */
int nm; /* Number of magnitudes per star */
{
StarInfo *stars;
int i, j, hasnum, hasobj, haspm, haspos;
int StarYSort ();
stars = (StarInfo *) calloc ((unsigned int)ns, sizeof(StarInfo));
if (sn == NULL)
hasnum = 0;
else
hasnum = 1;
if (sra != NULL && sdec != NULL)
haspos = 1;
else
haspos = 0;
if (spra != NULL && spdec != NULL)
haspm = 1;
else
haspm = 0;
if (sobj == NULL)
hasobj = 0;
else
hasobj = 1;
for (i = 0; i < ns; i++) {
if (hasnum)
stars[i].n = sn[i];
if (haspos) {
stars[i].ra = sra[i];
stars[i].dec = sdec[i];
}
if (haspm) {
stars[i].pra = spra[i];
stars[i].pdec = spdec[i];
}
stars[i].x = sx[i];
stars[i].y = sy[i];
for (j = 0; j < nm; j++)
stars[i].m[j] = sm[j][i];
stars[i].c = sc[i];
if (hasobj)
stars[i].obj = sobj[i];
}
qsort ((char *)stars, ns, sizeof(StarInfo), StarYSort);
for (i = 0; i < ns; i++) {
if (hasnum)
sn[i] = stars[i].n;
if (haspos) {
sra[i] = stars[i].ra;
sdec[i] = stars[i].dec;
}
if (haspm) {
spra[i] = stars[i].pra;
spdec[i] = stars[i].pdec;
}
sx[i] = stars[i].x;
sy[i] = stars[i].y;
for (j = 0; j < nm; j++)
sm[j][i] = stars[i].m[j];
sc[i] = stars[i].c;
if (hasobj)
sobj[i] = stars[i].obj;
}
free ((char *)stars);
return;
}
/* StarYSort -- Order stars in decreasing Y value called by qsort */
int
StarYSort (ssp1, ssp2)
void *ssp1, *ssp2;
{
double y1 = ((StarInfo *)ssp1)->y;
double y2 = ((StarInfo *)ssp2)->y;
if (y2 < y1)
return (1);
else if (y2 > y1)
return (-1);
else
return (0);
}
static int logmerge = 0;
/* MergeStars -- Merge multiple entries within given radius */
/* return mean ra, dec, proper motion, and magnitude(s) */
int
MergeStars (sn,sra,sdec,spra,spdec,sx,sy,sm,sc,sobj,ns,nm,rad,log)
double *sn; /* Identifying number */
double *sra; /* Right Ascension */
double *sdec; /* Declination */
double *spra; /* Right Ascension proper motion */
double *spdec; /* Declination proper motion */
double *sx; /* Image X coordinate */
double *sy; /* Image Y coordinate */
double **sm; /* Magnitudes */
int *sc; /* Other 4-byte information */
char **sobj; /* Object name */
int ns; /* Number of stars to sort */
int nm; /* Number of magnitudes per star */
double rad; /* Maximum separation in arcseconds to merge */
int log; /* If >0, log progress every time mod number written */
{
StarInfo *stars;
int i, j, hasnum, hasobj, haspm, hasxy;
int StarMerge();
int nns; /* Number of stars in merged catalog (returned) */
double drad; /* Maximum separation in degrees to merge */
int StarRASort();
stars = (StarInfo *) calloc ((unsigned int)ns, sizeof(StarInfo));
drad = rad / 3600.0;
logmerge = log;
if (sn == NULL)
hasnum = 0;
else
hasnum = 1;
if (spra != NULL && spdec != NULL)
haspm = 1;
else
haspm = 0;
if (sx != NULL && sy != NULL)
hasxy = 1;
else
hasxy = 0;
if (sobj == NULL)
hasobj = 0;
else
hasobj = 1;
for (i = 0; i < ns; i++) {
if (hasnum)
stars[i].n = sn[i];
else
stars[i].n = (double) i;
stars[i].ra = sra[i];
stars[i].dec = sdec[i];
if (haspm) {
stars[i].pra = spra[i];
stars[i].pdec = spdec[i];
}
else {
stars[i].pra = 0.0;
stars[i].pdec = 0.0;
}
if (hasxy) {
stars[i].x = sx[i];
stars[i].y = sy[i];
}
else {
stars[i].x = 0.0;
stars[i].y = 0.0;
}
for (j = 0; j < nm; j++)
stars[i].m[j] = sm[j][i];
stars[i].c = sc[i];
if (hasobj)
stars[i].obj = sobj[i];
}
/* Sort stars by right ascension */
if (logmerge)
fprintf (stderr, "MergeStars: Sorting %d stars\n", ns);
qsort ((char *)stars, ns, sizeof(StarInfo), StarRASort);
/* Merge RA-sorted catalogued stars within drad arcseconds of each other */
/* (array stars is replaced by shorter array) */
if (logmerge)
fprintf (stderr, "MergeStars: Merging %d stars\n", ns);
nns = StarMerge (ns, nm, &stars, drad);
/* Re-sort stars by right ascension */
if (logmerge)
fprintf (stderr, "MergeStars: Sorting %d stars\n", nns);
qsort ((char *)stars, nns, sizeof(StarInfo), StarRASort);
for (i = 0; i < nns; i++) {
if (hasnum)
sn[i] = stars[i].n;
sra[i] = stars[i].ra;
sdec[i] = stars[i].dec;
if (haspm) {
spra[i] = stars[i].pra;
spdec[i] = stars[i].pdec;
}
if (hasxy) {
sx[i] = stars[i].x;
sy[i] = stars[i].y;
}
for (j = 0; j < nm; j++)
sm[j][i] = stars[i].m[j];
sc[i] = stars[i].c;
if (hasobj)
sobj[i] = stars[i].obj;
}
free ((char *)stars);
return (nns);
}
#define MAXMERGE 32
/* StarMerge -- Merge stars, called by MergeStars() */
int
StarMerge (ns, nm, stars0, rad)
int ns; /* Number of stars to merge */
int nm; /* Number of magnitudes per star */
StarInfo **stars0;
double rad; /* Maximum separation in arcseconds to merge */
{
StarInfo *stars, *newstars;
double ra, dec, rsec, dsec, pra, pdec, mag[11];
double rai, deci, dn, dmax;
int i, is, js, nthis, im, no, nums[MAXMERGE];
stars = *stars0;
newstars = (StarInfo *) calloc ((unsigned int)ns, sizeof(StarInfo));
dmax = rad + 1.0;
/* Loop through stars in input catalog */
no = 0;
for (is = 1; is < ns; is++) {
/* Ignore star if has already been used */
if (stars[is].y == -999.0)
continue;
/* Initialize position to that of current star */
nthis = 1;
ra = stars[is].ra;
dec = stars[is].dec;
/* Find all stars within rad arcseconds of current input star */
/* Search forward (upward in RA) */
for (js = is; js < ns; js++) {
dsec = (stars[js].ra - stars[is].ra) * 3600.0;
if (dsec > dmax)
break;
if (is != js && stars[js].y != -999.0) {
rsec = wcsdist (stars[is].ra, stars[is].dec,
stars[js].ra, stars[js].dec);
if (rsec <= rad) {
nthis = nthis + 1;
ra = ra + stars[js].ra;
dec = dec + stars[js].dec;
}
}
}
/* Search backward (downward in RA) */
for (js = is; js > 0; js--) {
dsec = (stars[is].ra - stars[js].ra) * 3600.0;
if (dsec > dmax)
break;
if (is != js && stars[js].y != -999.0) {
rsec = wcsdist (stars[is].ra, stars[is].dec,
stars[js].ra, stars[js].dec);
if (rsec <= rad) {
nthis = nthis + 1;
ra = ra + stars[js].ra;
dec = dec + stars[js].dec;
}
}
}
/* Compute mean position for this star */
rai = ra / (double) nthis;
deci = dec / (double) nthis;
/* if (nthis > 1)
printf ("StarMerge: Merging %d stars at %d\n", nthis, is); */
/* Initialize output star parameters */
ra = 0.0;
dec = 0.0;
pra = 0.0;
pdec = 0.0;
for (im = 0; im < nm; im++)
mag[im] = 0.0;
nthis = 0;
for (i = 0; i < MAXMERGE; i++)
nums[i] = 0;
/* Find all stars within rad arcseconds of current mean position */
i = 0;
dmax = rad + 2.0;
/* Search forward (upward in RA) */
for (js = is; js < ns; js++) {
dsec = (stars[js].ra - rai) * 3600.0;
if (dsec > dmax)
break;
if (stars[js].y != -999.0) {
rsec = wcsdist (rai, deci, stars[js].ra, stars[js].dec);
if (rsec <= rad) {
nthis = nthis + 1;
ra = ra + stars[js].ra;
dec = dec + stars[js].dec;
pra = pra + stars[js].pra;
pdec = pdec + stars[js].pdec;
for (im = 0; im < nm; im++)
mag[im] = mag[im] + stars[js].m[im];
stars[js].y = -999.0;
nums[i++] = js;
}
}
}
/* Search backward (downward in RA) */
for (js = is; js > -1; js--) {
dsec = (rai - stars[js].ra) * 3600.0;
if (dsec > dmax)
break;
if (stars[js].y != -999.0) {
rsec = wcsdist (rai, deci, stars[js].ra, stars[js].dec);
if (rsec <= rad) {
nthis = nthis + 1;
ra = ra + stars[js].ra;
dec = dec + stars[js].dec;
pra = pra + stars[js].pra;
pdec = pdec + stars[js].pdec;
for (im = 0; im < nm; im++)
mag[im] = mag[im] + stars[js].m[im];
stars[js].y = -999.0;
nums[i++] = js;
}
}
}
if (nthis > 0) {
dn = (double) nthis;
newstars[no].ra = ra / dn;
newstars[no].dec = dec / dn;
newstars[no].pra = pra / dn;
newstars[no].pdec = pdec / dn;
for (im = 0; im < nm; im++)
newstars[no].m[im] = mag[im] / dn;
newstars[no].x = dn;
newstars[no].y = dn;
no = no + 1;
}
if (logmerge && no%logmerge == 0)
fprintf (stderr, "Merged %6d from %6d stars\r", no, is);
}
/* Free input star entries */
free (stars);
fprintf (stderr, "\n");
/* Reset input pointer to merged entries */
*stars0 = newstars;
return (no);
}
/* Jun 13 1996 New program
* Oct 18 1996 Add sorting by X value
* Nov 13 1996 Add second magnitude
* Jan 10 1997 Fix bug in RASortStars to return correct red magnitude
*
* Mar 2 1998 Make number and second magnitude optional
* Oct 21 1998 Add RefCat() to set reference catalog code
* Oct 26 1998 Include object names in star catalog entry structure
* Oct 29 1998 Return coordinate system and title from RefCat
* Nov 20 1998 Add USNO A-2.0 catalog and return different code
* Dec 9 1998 Add Hipparcos and Tycho catalogs
*
* Jan 26 1999 Add subroutines to deal with ranges of numbers
* Feb 8 1999 Fix bug initializing ACT catalog
* Feb 11 1999 Change starcat.insys to starcat.coorsys
* May 19 1999 Move catalog subroutines to catutil()
* Aug 26 1999 Compare pointers to NULL, not 0
*
* Mar 14 2000 Add proper motions
*
* May 22 2001 Add sort by declination
* Jun 28 2001 In MagSort, if b mag is 99.9, try r mag
* Jul 20 2001 In MagSort, allow for absence of ra and dec
* Sep 12 2001 Allow up to 11 magnitudes; add nm and magsort
* Sep 13 2001 Add YSortStars() to sort by Y coordinate
* Sep 18 2001 Subtract 100 in MagSort if magnitude is greater than 100
* Nov 6 2001 Allow missing x and y in MagSort, RASort, and DecSort
* Nov 6 2001 Allow missing ra and dec in XSort and YSort
*
* Apr 8 2002 Drop static subroutine declarations
*
* Sep 23 2003 Add MergeStars() and StarMerge() to merge input catalog
*
* Mar 4 2004 Fix rad in MergeStars()
* Mar 17 2004 RA-sort before and after merging catalog in MergeStars()
* Mar 17 2004 Rewrite StarMerge() to merge RA-sorted catalog quickly
* Mar 18 2004 Add logging to StarMerge()
* Aug 30 2004 Fix bad declaration
*
* Apr 13 2006 Add sort by ID number
*
* Jan 11 2007 Include fitsfile.h
*
* Nov 6 2009 Set number of magnitudes from MAXNMAG parameter in wcscat.h
*
* Jun 24 2016 Always initialize haspm in RASortStars() (from Ole Streicher)
*/
|