/* * Copyright (C) 1998 by Southwest Research Institute (SwRI) * * All rights reserved under U.S. Copyright Law and International Conventions. * * The development of this Software was supported by contracts NAG5-3148, * NAG5-6855, NAS8-36840, NAG5-2323, and NAG5-7043 issued on behalf of * the United States Government by its National Aeronautics and Space * Administration. Southwest Research Institute grants to the Government, * and others acting on its behalf, a paid-up nonexclusive, irrevocable, * worldwide license to reproduce, prepare derivative works, and perform * publicly and display publicly, by or on behalf of the Government. * Other than those rights granted to the United States Government, no part * of this Software may be reproduced in any form or by any means, electronic * or mechanical, including photocopying, without permission in writing from * Southwest Research Institute. All inquiries should be addressed to: * * Director of Contracts * Southwest Research Institute * P. O. Drawer 28510 * San Antonio, Texas 78228-0510 * * * Use of this Software is governed by the terms of the end user license * agreement, if any, which accompanies or is included with the Software * (the "License Agreement"). An end user will be unable to install any * Software that is accompanied by or includes a License Agreement, unless * the end user first agrees to the terms of the License Agreement. Except * as set forth in the applicable License Agreement, any further copying, * reproduction or distribution of this Software is expressly prohibited. * Installation assistance, product support and maintenance, if any, of the * Software is available from SwRI and/or the Third Party Providers, as the * case may be. * * Disclaimer of Warranty * * SOFTWARE IS WARRANTED, IF AT ALL, IN ACCORDANCE WITH THESE TERMS OF THE * LICENSE AGREEMENT. UNLESS OTHERWISE EXPLICITLY STATED, THIS SOFTWARE IS * PROVIDED "AS IS", IS EXPERIMENTAL, AND IS FOR NON-COMMERCIAL USE ONLY, * AND ALL EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A PARTICULAR * PURPOSE, OR NON-INFRINGEMENT, ARE DISCLAIMED, EXCEPT TO THE EXTENT THAT * SUCH DISCLAIMERS ARE HELD TO BE LEGALLY INVALID. * * Limitation of Liability * * SwRI SHALL NOT BE LIABLE FOR ANY DAMAGES SUFFERED AS A RESULT OF USING, * MODIFYING, CONTRIBUTING, COPYING, DISTRIBUTING, OR DOWNLOADING THIS * SOFTWARE. IN NO EVENT SHALL SwRI BE LIABLE FOR ANY INDIRECT, PUNITIVE, * SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGE (INCLUDING LOSS OF BUSINESS, * REVENUE, PROFITS, USE, DATA OR OTHER ECONOMIC ADVANTAGE) HOWEVER IT ARISES, * WHETHER FOR BREACH OF IN TORT, EVEN IF SwRI HAS BEEN PREVIOUSLY ADVISED OF * THE POSSIBILITY OF SUCH DAMAGE. YOU HAVE SOLE RESPONSIBILITY FOR ADEQUATE * PROTECTION AND BACKUP OF DATA AND/OR EQUIPMENT USED IN CONNECTION WITH THE * SOFTWARE AND WILL NOT MAKE A CLAIM AGAINST SwRI FOR LOST DATA, RE-RUN TIME, * INACCURATE OUTPUT, WORK DELAYS OR LOST PROFITS RESULTING FROM THE USE OF * THIS SOFTWARE. YOU AGREE TO HOLD SwRI HARMLESS FROM, AND YOU COVENANT NOT * TO SUE SwRI FOR, ANY CLAIMS BASED ON USING THE SOFTWARE. * * Local Laws: Export Control * * You acknowledge and agree this Software is subject to the U.S. Export * Administration Laws and Regulations. Diversion of such Software contrary * to U.S. law is prohibited. You agree that none of the Software, nor any * direct product therefrom, is being or will be acquired for, shipped, * transferred, or reexported, directly or indirectly, to proscribed or * embargoed countries or their nationals, nor be used for nuclear activities, * chemical biological weapons, or missile projects unless authorized by U.S. * Government. Proscribed countries are set forth in the U.S. Export * Administration Regulations. Countries subject to U.S embargo are: Cuba, * Iran, Iraq, Libya, North Korea, Syria, and the Sudan. This list is subject * to change without further notice from SwRI, and you must comply with the * list as it exists in fact. You certify that you are not on the U.S. * Department of Commerce's Denied Persons List or affiliated lists or on the * U.S. Department of Treasury's Specially Designated Nationals List. You agree * to comply strictly with all U.S. export laws and assume sole responsibilities * for obtaining licenses to export or reexport as may be required. * * General * * These Terms represent the entire understanding relating to the use of the * Software and prevail over any prior or contemporaneous, conflicting or * additional, communications. SwRI can revise these Terms at any time * without notice by updating this posting. * * Trademarks * * The SwRI logo is a trademark of SwRI in the United States and other countries. * */ #ident "@(#) $Id: two_d_cyc.c 18714 2007-10-17 16:08:41Z carrie $ SwRI" #include "libIDFSFill.h" /***************************************************************************** * * * IDFSFILL_TWO_D_CYC SUBROUTINE * * * * DESCRIPTION * * This routine is called to perform a 2-D least square's fit for cyclic * * data to fill in missing bin elements. * * * * INPUT VARIABLES * * SDDAS_CHAR *norm pointer to the first element in the bin * * status block to be examined * * SDDAS_FLOAT *dptr pointer to the first element in the data * * block that is to be examined * * SDDAS_LONG ncol the number of columns of data * * SDDAS_LONG nscan the number of elements in a column of data * * SDDAS_LONG row, col the current row/column being processed * * SDDAS_LONG need_filled number of filled bins needed to perform the* * calculations to determine the missing bins * * SDDAS_FLOAT tension the weighting of the data * * SDDAS_SHORT order the order of the fit (1, 2, 3, etc) * * * * USAGE * * x = IDFSFill_two_d_cyc (norm, dptr, ncol, nscan, row, col, * * need_filled, tension, order) * * * * NECESSARY SUBPROGRAMS * * IDFSFill_sum_any_ord () * * IDFSFill_two_d_lin () * * * * EXTERNAL VARIABLES * * None * * * * INTERNAL VARIABLES * * register SDDAS_FLOAT *f1 fast floating point pointer * * reg SDDAS_LONG *l2, *l3 fast long pointer * * register SDDAS_LONG filled number of bins found to be filled with data* * register SDDAS_LONG a index into data array * * register SDDAS_CHAR *c1 pointer to the bin status value of interest* * SDDAS_FLOAT sums[] * * SDDAS_FLOAT val * * SDDAS_LONG inc * * SDDAS_LONG close * * SDDAS_LONG pos4[] * * SDDAS_LONG trow * * SDDAS_LONG tcol * * SDDAS_LONG drow * * SDDAS_LONG dcol * * SDDAS_LONG i, j looping variables * * SDDAS_LONG half_phi * * * * SUBSYSTEM * * Display Level * * * ****************************************************************************/ SDDAS_FLOAT IDFSFill_two_d_cyc (SDDAS_CHAR *norm, SDDAS_FLOAT *dptr, SDDAS_LONG ncol, SDDAS_LONG nscan, SDDAS_LONG row, SDDAS_LONG col, SDDAS_LONG need_filled, SDDAS_FLOAT tension, SDDAS_SHORT order) { register SDDAS_FLOAT *f1; register SDDAS_LONG *l2, *l3, filled, a; register SDDAS_CHAR *c1; SDDAS_FLOAT sums[400], val; SDDAS_LONG inc = 0, close = -1, pos4[4]; SDDAS_LONG trow, tcol, drow, dcol, i, j, half_phi; SDDAS_LONG signc[4] = {1,1,-1,-1}; SDDAS_LONG signr[4] = {1,-1,1,-1}; filled = 0; half_phi = ncol/2 + ncol % 2; c1 = norm; for (f1 = sums; f1 < sums + 400; ++f1) *f1 = 0.0; while ((filled < need_filled) && (++inc < half_phi)) { l2 = pos4; a = row - inc; *l2++ = (a < 0) ? -1 : col * nscan + a; a = row + inc; *l2++ = (a < nscan) ? col * nscan + a : -1; a = col + inc; *l2++ = (a >= ncol) ? (a - ncol) * nscan + row : a * nscan + row; a = col - inc; *l2++ = (a < 0) ? (a + ncol) * nscan + row : a * nscan + row; for (i = 0, l2 = pos4; l2 < pos4 + 4; ++l2, ++i) { if (*l2 >= 0) { if (*(c1 + *l2) > 0) { drow = (i > 1) ? 0 : (i == 0) ? inc : -inc; dcol = (i < 2) ? 0 : (i == 3) ? -inc : inc; if (close < 0) close = inc * inc; ++filled; IDFSFill_sum_any_ord (dptr[*l2], sums, drow, dcol, close, tension, order); } } } if (filled < need_filled) { for (l2 = signr, l3 = signc; l2 < signr + 4; ++l2,++l3) { for (i = 1, j = inc; i <= inc; ++i, --j) { trow = row + i * *l2; tcol = col + j * *l3; if (tcol < 0) tcol = ncol + tcol; else { if (tcol >= ncol) tcol = tcol - ncol; } if (trow >= 0 && trow < nscan) { a = tcol * nscan + trow; if (*(c1 + a) > 0) { drow = -i * *l2; dcol = j * *l3; if (close < 0) close = drow*drow + dcol*dcol; ++filled; IDFSFill_sum_any_ord (dptr[a], sums, drow, dcol, close, tension, order); } } } } } } val = IDFSFill_two_d_lin (sums,order); return (val); }