C ++********************************************************************
C                                                                      *
C                                                                      *
C                                                                      *
C **********************************************************************
C=* FROM: SPIDER - MODULAR IMAGE PROCESSING SYSTEM.   AUTHOR: J.FRANK  *
C=* Copyright (C) 1985-2005  Health Research Inc.                      *
C=*                                                                    *
C=* HEALTH RESEARCH INCORPORATED (HRI),                                *   
C=* ONE UNIVERSITY PLACE, RENSSELAER, NY 12144-3455.                   *
C=*                                                                    *
C=* Email:  spider@wadsworth.org                                       *
C=*                                                                    *
C=* This program is free software; you can redistribute it and/or      *
C=* modify it under the terms of the GNU General Public License as     *
C=* published by the Free Software Foundation; either version 2 of the *
C=* License, or (at your option) any later version.                    *
C=*                                                                    *
C=* This program is distributed in the hope that it will be useful,    *
C=* but WITHOUT ANY WARRANTY; without even the implied warranty of     *
C=* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU  *
C=* General Public License for more details.                           *
C=*                                                                    *
C=* You should have received a copy of the GNU General Public License  *
C=* along with this program; if not, write to the                      *
C=* Free Software Foundation, Inc.,                                    *
C=* 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.      *
C=*                                                                    *
C **********************************************************************
C                                                                      *
C                                                                      *
C                                                                      *
C  PURPOSE:                                                            *
C     COMPUTES THE SCALE FACTOR OF VPT WITH RESPECT TO RPT, USING ONLY
C     POINTS THEY HAVE IN COMMON. THIS THEN MUST BE APPLIED TO VPT
C     TO MAKE IT FIT TO RPT
C
C     USES ROOT OF RATIO BETWEEN SUM OF SQUARES OF COORDS OF RPT/VPT.
C
C INPUT:
C     RPT(3,LS)= COORDS OF POINTS IN REFERENCE VIEW
C     VPT(3,LS)= COORDS OF POINTS IN VIEW TO BE ADJUSTED
C     IVIEW= INDEX OF VIEW TO BE REFINED
C COMMON INPUT:
C     PTACTIVE(LS,LV)= BOOLEAN ARRAY REFERENCING POINTS TO BE USED
C          (IE. CAN BE FOUND IN VPT VIEW) .TRUE. IF USED
C     NUMPT(LV)= MAXIMUM INDEX OF POINTS USED IN VPT
C OUTPUT:
C     SCALEI= SCALE FACTOR OF VPT VIEW WITH RESPECT TO RPT VIEW
C                                                                      *
C  PARAMETERS:                                                         *
C                                                                      *
C23456789012345678901234567890123456789012345678901234567890123456789012
C***********************************************************************

      SUBROUTINE MRSCALE(RPT, VPT, IVIEW, SCALEI)

      PARAMETER (LV=300)
      PARAMETER (LS=256)

      LOGICAL*1   PTACTIVE(LS,LV),PARAMQ(4)
      COMMON /GENERAL/PTACTIVE,NUMPTS(LV),NTVW,NTPT,CIR(2),PARAMQ

      DIMENSION    RPT(2,LS), VPT(2,LS), SCALEI(LV)
      DOUBLE PRECISION  RSUM,VSUM

      RSUM=0.0
      VSUM=0.0

C     SUMS UP THE SQUARES OF THE COORDS
      DO  M=1,NUMPTS(IVIEW)
        IF (PTACTIVE(M,IVIEW)) THEN
          RSUM = RSUM+RPT(1,M)*DBLE(RPT(1,M))
     &			+RPT(2,M)*DBLE(RPT(2,M))
          VSUM = VSUM+VPT(1,M)*DBLE(VPT(1,M))
     &			+VPT(2,M)*DBLE(VPT(2,M))
	ENDIF
      ENDDO

      SCALEI(IVIEW )= DSQRT(RSUM/VSUM)

      END