This is hpointnb.c in view mode; [Download] [Up]
/* Copyright (c) 1993 The Geometry Center; University of Minnesota
1300 South Second Street; Minneapolis, MN 55454, USA;
This file is part of geomview/OOGL. geomview/OOGL is free software;
you can redistribute it and/or modify it only under the terms given in
the file COPYING, which you should have received along with this file.
This and other related software may be obtained via anonymous ftp from
geom.umn.edu; email: software@geom.umn.edu. */
/* Authors: Charlie Gunn, Pat Hanrahan, Stuart Levy, Tamara Munzner, Mark Phillips */
#include <ooglutil.h>
#include "hpointn.h"
#include <math.h>
HPointN *
HPtNCopy(const HPointN *pt1, HPointN *pt2)
{
if(pt2 == NULL) {
pt2 = HPtNCreate(pt1->dim, pt1->v);
} else {
if(pt2->dim != pt1->dim) {
pt2->v = OOGLRenewNE(HPtNCoord, pt2->v, pt1->dim, "renew HPointN");
pt2->dim = pt1->dim;
}
memcpy(pt2->v, pt1->v, pt1->dim*sizeof(HPtNCoord));
}
/* pt2->space = pt1->space; */
return(pt2);
}
HPointN *
HPtNPad(HPointN *pt1, short dim2, HPointN *pt2)
{
short dim1 = pt1->dim;
int i;
if( dim2 < 1 ) {
return(NULL);
}
if(pt1 == NULL) {
pt2 = HPtNCreate(dim2,NULL);
return(pt2);
}
if(pt1 != pt2) {
if(pt2 == NULL)
pt2 = HPtNCreate(dim2,NULL);
else if (pt2->dim != dim2) {
pt2->v = OOGLRenewNE(HPtNCoord, pt2->v, dim2, "renew HPointN");
pt2->dim = dim2;
}
if (dim1 <= dim2) {
bzero(pt2->v,dim2*sizeof(HPtNCoord));
for(i=0; i<dim1-1; i++)
pt2->v[i] = pt1->v[i];
} else if ( dim1 > dim2 ) {
for(i=0; i<dim2-1; i++)
pt2->v[i] = pt1->v[i];
}
pt2->v[dim2-1] = pt1->v[dim1-1];
} else {
HPointN *newpt = HPtNCreate(dim2,NULL);
if (dim1 <= dim2) {
for(i=0; i<dim1-1; i++)
newpt->v[i] = pt1->v[i];
} else if ( dim1 > dim2 ) {
for(i=0; i<dim2-1; i++)
newpt->v[i] = pt1->v[i];
}
newpt->v[dim2-1] = pt1->v[dim1-1];
HPtNCopy(newpt,pt2);
}
return(pt2);
}
HPointN *
HPtNAdd(const HPointN *pt1, const HPointN *pt2, HPointN *sum)
{
short dim1 = pt1->dim, dim2 = pt2->dim;
int i;
if(dim1 == dim2) {
if(sum == NULL)
sum = HPtNCreate(dim1,NULL);
else if(sum->dim < dim1) {
sum->v = OOGLRenewNE(HPtNCoord, sum->v, dim1, "renew HPointN");
sum->dim = dim1;
}
for( i=0; i<dim1-1; i++)
sum->v[i] = pt1->v[i] + pt2->v[i];
sum->v[dim1-1] = pt1->v[dim1-1];
sum->dim = dim1;
} else if (dim1 > dim2) {
if(sum == NULL)
sum = HPtNCreate(dim1,NULL);
else if(sum->dim < dim1) {
sum->v = OOGLRenewNE(HPtNCoord, sum->v, dim1, "renew HPointN");
sum->dim = dim1;
}
for( i=0; i<dim2-1; i++)
sum->v[i] = pt1->v[i] + pt2->v[i];
for( i=dim2-1; i<dim1-1; i++)
sum->v[i] = pt1->v[i];
sum->v[dim1-1] = pt1->v[dim1-1];
sum->dim = dim1;
} else if (dim1 < dim2) {
if(sum == NULL)
sum = HPtNCreate(dim2,NULL);
else if(sum->dim < dim2) {
sum->v = OOGLRenewNE(HPtNCoord, sum->v, dim2, "renew HPointN");
sum->dim = dim2;
}
for( i=0; i<dim1-1; i++)
sum->v[i] = pt1->v[i] + pt2->v[i];
for( i=dim1-1; i<dim2-1; i++)
sum->v[i] = pt2->v[i];
sum->v[dim2-1] = pt1->v[dim1-1];
sum->dim = dim2;
}
return(sum);
}
/* Space */
int
HPtNSpace( const HPointN *pt );
HPointN *
HPtNSetSpace( HPointN *pt, int space );
/* Linear combination */
HPointN *
HPtNComb(HPtNCoord u, const HPointN *pu, HPtNCoord v, const HPointN *pv, HPointN *sum)
{
short dimu = pu->dim, dimv = pv->dim;
int i;
if(dimu == dimv) {
if(sum == NULL)
sum = HPtNCreate(dimu,NULL);
else if(sum->dim < dimu) {
sum->v = OOGLRenewNE(HPtNCoord, sum->v, dimu, "renew HPointN");
sum->dim = dimu;
}
for( i=0; i<dimu-1; i++)
sum->v[i] = u * pu->v[i] + v * pv->v[i];
sum->v[dimu-1] = pu->v[dimu-1];
sum->dim = dimu;
} else if( dimu > dimv ) {
if(sum == NULL)
sum = HPtNCreate(dimu,NULL);
else if(sum->dim < dimu) {
sum->v = OOGLRenewNE(HPtNCoord, sum->v, dimu, "renew HPointN");
sum->dim = dimu;
}
for( i=0; i<dimv-1; i++)
sum->v[i] = u * pu->v[i] + v * pv->v[i];
for( i=dimv-1; i<dimu-1; i++)
sum->v[i] = u * pu->v[i];
sum->v[dimu-1] = pu->v[dimu-1];
sum->dim = dimu;
} else if( dimu < dimv ) {
if(sum == NULL)
sum = HPtNCreate(dimv,NULL);
else if(sum->dim < dimv) {
sum->v = OOGLRenewNE(HPtNCoord, sum->v, dimv, "renew HPointN");
sum->dim = dimv;
}
for( i=0; i<dimu-1; i++)
sum->v[i] = u * pu->v[i] + v * pv->v[i];
for( i=dimu-1; i<dimv-1; i++)
sum->v[i] = v * pv->v[i];
sum->v[dimv-1] = pu->v[dimu-1];
sum->dim = dimv;
}
return(sum);
}
/* Reduce to unit vector */
HPointN *
HPtNUnit(const HPointN *from, HPointN *to)
{
register HPtNCoord len = 0;
short dim = from->dim;
int i;
for( i=0; i<dim-1; i++)
len += from->v[i] * from->v[i];
if( (len = sqrt( len )) != 0) {
if(to == NULL)
to = HPtNCreate(dim,NULL);
else if(to->dim != dim) {
to->v = OOGLRenewNE(HPtNCoord, to->v, dim, "renew HPointN");
to->dim = dim;
}
for( i=0; i<dim-1; i++)
to->v[i] = from->v[i] /len;
to->v[dim-1] = from->v[dim-1];
} else
HPtNCopy(from,to);
return(to);
}
/* Dehomogenize */
HPtNCoord
HPtNDehomogenize(const HPointN *from, HPointN *to)
{
short dim = from->dim;
register HPtNCoord inv = 1.0 / from->v[dim-1];
int i;
if( from->v[dim-1] == 1.0 || from->v[dim-1] == 0.0) {
if( from != to) HPtNCopy(from,to);
return;
}
if(to == NULL)
to = HPtNCreate(dim,NULL);
else if(to->dim != dim) {
to->v = OOGLRenewNE(HPtNCoord, to->v, dim, "renew HPointN");
to->dim = dim;
}
for( i=0; i<dim-1; i++)
to->v[i] = from->v[i] * inv;
to->v[dim-1] = 1.0;
return(1./inv);
}
/* Apply a TransformN to an HPointN */
HPointN *
HPtNTransform( const TransformN *T, const HPointN *from, HPointN *to )
{
short idim = T->idim, odim = T->odim, dim = from->dim;
int i, j;
HPtNCoord *v = (HPtNCoord *)malloc(idim*sizeof(HPtNCoord));
for( i=0; i<idim; i++)
v[i] = from->v[i];
if(to == NULL)
to = HPtNCreate(odim,NULL);
else if(to->dim != odim) {
to->v = OOGLRenewNE(HPtNCoord, to->v, odim, "renew HPointN");
to->dim = odim;
}
if (idim == dim) {
for( i=0; i<odim; i++) {
to->v[i] = 0;
for( j=0; j<idim; j++)
to->v[i] += v[j] * T->a[j*odim+i];
}
} else if (idim > dim) { /* padding with zeroes */
for( i=0; i<odim; i++) {
to->v[i] = 0;
for( j=0; j<dim; j++)
to->v[i] += v[j] * T->a[j*odim+i];
}
} else if (idim < dim) {
for( i=0; i<odim; i++) {
to->v[i] = 0;
for( j=0; j<idim; j++)
to->v[i] += v[j] * T->a[j*odim+i];
if( i>idim-1)
to->v[i] += v[i];
}
}
free(v);
return(to);
}
/* Dot product of two vectors */
HPtNCoord
HPtNDot( const HPointN *p1, const HPointN *p2)
{
HPtNCoord result;
register int i;
short dim = p1->dim;
if (p2->dim < dim) {
dim = p2->dim;
}
result = 0;
for( i = 0; i< dim-1; i++)
result += p1->v[i] * p2->v[i];
return(result);
}
/* Return index'th component of p . T */
/* If index is out of range (e.g. -1), return N-1'th component
* (i.e. homogeneous divisor).
*/
HPtNCoord *
HPtNTransformComponents( const HPointN *p, const TransformN *T, int ncomponents, int *indices, HPtNCoord *results )
{
short idim = T->idim, odim = T->odim, dim = p->dim;
int i, j, k;
HPtNCoord *v = p->v;
if( ncomponents < 0 || ncomponents > odim ) {
return NULL;
}
if ( idim == dim ) {
for ( k = 0; k < ncomponents; k++ ) {
i = indices[k];
if( i < 0 || i > odim )
i = odim-1;
results[k] = 0;
for( j=0; j<idim; j++)
results[k] += v[j] * T->a[j*odim+i];
}
} else if ( idim < dim ) {
for ( k = 0; k < ncomponents; k++ ) {
i = indices[k];
if( i < 0 || i > odim )
i = odim-1;
results[k] = v[dim-1] * T->a[(idim-1)*odim + i];
for( j=0; j<idim-1; j++)
results[k] += v[j] * T->a[j*odim+i];
if( i>idim-1)
results[k] += v[i];
}
} else { /* idim > dim */
for ( k = 0; k < ncomponents; k++ ) {
i = indices[k];
if( i < 0 || i > odim )
i = odim-1;
results[k] = v[dim-1] * T->a[(idim-1)*odim + i];
for( j=0; j<dim-1; j++)
results[k] += v[j] * T->a[j*odim+i];
}
}
return(results);
}
These are the contents of the former NiCE NeXT User Group NeXTSTEP/OpenStep software archive, currently hosted by Netfuture.ch.