/****************************************************************************\ Copyright 1995 The University of North Carolina at Chapel Hill. All Rights Reserved. Permission to use, copy, modify and distribute this software and its documentation for educational, research and non-profit purposes, without fee, and without a written agreement is hereby granted, provided that the above copyright notice and the following three paragraphs appear in all copies. IN NO EVENT SHALL THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF NORTH CAROLINA HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. Permission to use, copy, modify and distribute this software and its documentation for educational, research and non-profit purposes, without fee, and without a written agreement is hereby granted, provided that the above copyright notice and the following three paragraphs appear in all copies. THE UNIVERSITY OF NORTH CAROLINA SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND THE UNIVERSITY OF NORTH CAROLINA HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. The author may be contacted via: US Mail: Jonathan Cohen Department of Computer Science Sitterson Hall, CB #3175 University of N. Carolina Chapel Hill, NC 27599-3175 Phone: (919)962-1749 EMail: cohenj@cs.unc.edu \****************************************************************************/ /* Program to remove certain vertices from a model. Jonathan Cohen, December, 1995 */ #include #include #include #include #define FALSE 0 #define TRUE 1 #define X 0 #define Y 1 #define Z 2 double LAmag,LAsum; int LAi,LAj,LAk; #define VEC3_ZERO(a) { a[0]=a[1]=a[2]=0; } #define VEC3_NEG(a,b) { a[0]= -b[0]; a[1]= -b[1];a[2]= -b[2];} #define VEC3_V_OP_V(a,b,op,c) { a[0] = b[0] op c[0]; \ a[1] = b[1] op c[1]; \ a[2] = b[2] op c[2]; \ } #define VEC3_ASN_OP(a,op,b) {a[0] op b[0]; a[1] op b[1]; a[2] op b[2];} #define DOTPROD3(a, b) (a[0]*b[0] + a[1]*b[1] + a[2]*b[2]) #define CROSSPROD3(a,b,c) {a[0]=b[1]*c[2]-b[2]*c[1]; \ a[1]=b[2]*c[0]-b[0]*c[2]; \ a[2]=b[0]*c[1]-b[1]*c[0];} #define NORMALIZE3(a) {LAmag=1./sqrt(a[0]*a[0]+a[1]*a[1]+a[2]*a[2]);\ a[0] *= LAmag; a[1] *= LAmag; a[2] *= LAmag;} #define ZERO3_TOL(a, tol) { a[0] = ((a[0]-tol))?0.0:a[0];\ a[1] = ((a[1]-tol))?0.0:a[1];\ a[2] = ((a[2]-tol))?0.0:a[2];\ } #define SQ_DIST3(a, b) ((a[0]-b[0])*(a[0]-b[0]) + \ (a[1]-b[1])*(a[1]-b[1]) + \ (a[2]-b[2])*(a[2]-b[2])) #define FMAX(x,y) ((x)>(y) ? (x) : (y)) #define FMIN(x,y) ((x)<(y) ? (x) : (y)) #define FP_EQ_EPS( a, b, c ) ((((a) - (b)) <= (c)) && (((a) - (b)) >= -(c))) /* user's vertex and face definitions for a polygonal object */ typedef float Point[3]; typedef float Vector[3]; typedef struct Vertex { int id; unsigned char deleted; void *other_props; /* other properties */ } Vertex; typedef struct Face { int id; unsigned char nverts; /* number of vertex indices in list */ int *verts; /* vertex index list */ void *other_props; /* other properties */ unsigned char deleted; } Face; PlyProperty vert_props[1]; /* list of property information for a vertex */ PlyProperty face_props[] = { /* list of property information for a face */ {"vertex_indices", PLY_INT, PLY_INT, offsetof(Face,verts), 1, PLY_UCHAR, PLY_UCHAR, offsetof(Face,nverts)}, }; /*** the PLY object ***/ static int nverts,nfaces; static Vertex **vlist; static Face **flist; static PlyOtherElems *other_elements = NULL; static PlyOtherProp *vert_other,*face_other,*edge_other; static int nelems; static char **element_list; static int num_comments; static char **comments; static int num_obj_info; static char **obj_info; static int file_type; int has_fverts; char **deleted_verts; int num_deleted_verts; /****************************************************************************** Main program. ******************************************************************************/ main(int argc, char *argv[]) { get_options(argc, argv); read_file(); delete_verts(); write_file(); } get_options(int argc, char *argv[]) { char *s; char *progname; int dummy; progname = argv[0]; while (--argc > 0 && (*++argv)[0]=='-') { for (s = argv[0]+1; *s; s++) switch (*s) { case 'v': ++argv; deleted_verts = argv; for (num_deleted_verts = 0; ((*argv) && (sscanf((*argv), "%d\n", &dummy) == 1)); num_deleted_verts++) ++argv; --argv; argc -= num_deleted_verts; break; default: usage (progname); exit (-1); break; } } } /****************************************************************************** Print out usage information. ******************************************************************************/ usage(char *progname) { fprintf(stderr, "usage: %s [flags] out.ply\n", progname); fprintf(stderr, " -- optional flags -- \n"); fprintf(stderr, " -a : average neighboring vertex curvatures\n"); } delete_verts() { int i, j; int id; Face *face; for (i=0; ideleted = FALSE; /* mark the appropriate verts deleted */ for (i=0; i= nverts)) { fprintf(stderr, "Invalid vert id\n"); exit(-1); } vlist[id]->deleted = TRUE; } /* now delete any associated faces */ for (i=0; ideleted = FALSE; for (j=0; jnverts; j++) if (vlist[face->verts[j]]->deleted == TRUE) face->deleted = TRUE; } /* now delete any unused vertices (there might be some extra unused verts because of the faces we deleted */ for (i=0; ideleted = TRUE; for (i=0; ideleted == TRUE) continue; for (j=0; jnverts; j++) vlist[face->verts[j]]->deleted = FALSE; } } /****************************************************************************** Read in the PLY file from standard in. ******************************************************************************/ read_file() { int i,j,k; PlyFile *ply; int nprops; int num_elems; PlyProperty **plist; char *elem_name; float version; /*** Read in the original PLY object ***/ ply = ply_read (stdin, &nelems, &element_list); ply_get_info (ply, &version, &file_type); for (i = 0; i < nelems; i++) { /* get the description of the first element */ elem_name = element_list[i]; plist = ply_get_element_description (ply, elem_name, &num_elems, &nprops); if (equal_strings ("vertex", elem_name)) { /* create a vertex list to hold all the vertices */ vlist = (Vertex **) malloc (sizeof (Vertex *) * num_elems); nverts = num_elems; vert_other = ply_get_other_properties (ply, elem_name, offsetof(Vertex,other_props)); /* grab all the vertex elements */ for (j = 0; j < num_elems; j++) { vlist[j] = (Vertex *) malloc (sizeof (Vertex)); ply_get_element (ply, (void *) vlist[j]); vlist[j]->id = j; } } else if (equal_strings ("face", elem_name)) { /* create a list to hold all the face elements */ flist = (Face **) malloc (sizeof (Face *) * num_elems); nfaces = num_elems; /* set up for getting face elements */ /* verify which properties these vertices have */ has_fverts = FALSE; for (j=0; jname)) { ply_get_property (ply, elem_name, &face_props[0]); /* vertex_indices */ has_fverts = TRUE; } } face_other = ply_get_other_properties (ply, elem_name, offsetof(Face,other_props)); /* test for necessary properties */ if (!has_fverts) { fprintf(stderr, "Faces must have vertex indices\n"); exit(-1); } /* grab all the face elements */ for (j = 0; j < num_elems; j++) { flist[j] = (Face *) malloc (sizeof (Face)); ply_get_element (ply, (void *) flist[j]); flist[j]->id = j; } } else other_elements = ply_get_other_element (ply, elem_name, num_elems); } comments = ply_get_comments (ply, &num_comments); obj_info = ply_get_obj_info (ply, &num_obj_info); ply_close (ply); } /****************************************************************************** Write out the PLY file to standard out. ******************************************************************************/ write_file() { int i,j,k; PlyFile *ply; int num_elems; char *elem_name; int new_nverts, new_nfaces; Face *face; Vertex *vert; int num_known_elements = 2; char *known_elements[] = {"vertex", "face"}; /*** Write out the final PLY object ***/ num_known_elements = 2; ply = ply_write (stdout, num_known_elements, known_elements, file_type); /* count and renumber vertices */ for (i=0, new_nverts=0; ideleted == TRUE) continue; vert->id = new_nverts++; } /* count faces and renumber vertex indices */ for (i=0, new_nfaces=0; ideleted == TRUE) continue; for (j=0; jnverts; j++) face->verts[j] = vlist[face->verts[j]]->id; new_nfaces++; } /* describe what properties go into the vertex and face elements */ ply_element_count (ply, "vertex", new_nverts); ply_describe_other_properties (ply, vert_other, offsetof(Vertex,other_props)); ply_element_count (ply, "face", new_nfaces); ply_describe_property (ply, "face", &face_props[0]); ply_describe_other_properties (ply, face_other, offsetof(Face,other_props)); ply_describe_other_elements (ply, other_elements); for (i = 0; i < num_comments; i++) ply_put_comment (ply, comments[i]); for (i = 0; i < num_obj_info; i++) ply_put_obj_info (ply, obj_info[i]); ply_header_complete (ply); /* set up and write the vertex elements */ ply_put_element_setup (ply, "vertex"); for (i = 0; i < nverts; i++) if (vlist[i]->deleted == FALSE) ply_put_element (ply, (void *) vlist[i]); /* set up and write the face elements */ ply_put_element_setup (ply, "face"); for (i = 0; i < nfaces; i++) if (flist[i]->deleted == FALSE) ply_put_element (ply, (void *) flist[i]); ply_put_other_elements (ply); /* close the PLY file */ ply_close (ply); }