pnmtops/ 40755 5770 144 0 6317065172 11742 5ustar cloisteruserspnmtops/COPYING100644 5770 144 43100 6316662704 13113 0ustar cloisterusers GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS Appendix: How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 19yy This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program 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 General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19yy name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. pnmtops/pnmtops.1100644 5770 144 11240 6316675270 13644 0ustar cloisterusers.\" SCCSID: @(#)pnmtops.1 8.1 4/25/94 .\" SCCSID: @(#)pnmtops.1 8.1 4/25/94 .TH pnmtops 1 .SH Name pnmtops \- convert pnm bitmap files into polygon-based PostScript(R) files. .SH Syntax .B pnmtops .B [ -bg {\fIRR GG BB\fB | \fIGREYVALUE\fB } ] .B [ -s \fIscale_factor\fR] .B [ -l ] .B [ -p ] .B [ -eps ] .B [ \fIpnmfile\fB ] \fR > \fIoutput_file\fR .SH Description .NXR "pnmtops command" .NXA "pnmtops command" The .BR pnmtops command converts pnm files, which are bitmapped images in pbm, pgm, or ppm format, into PostScript in an intelligent way. Rather than just converting the bitmap into a blob of data conforming to the format used by the PostScript "image" and "colorimage" operators, .BR pnmtops isolates all the polygons in the image (adjacent pixels with the same color) and writes PostScript descriptions of those polygons. This results in much smaller PostScript files than if you convert the pnm file to PostScript using a utility like .BR xv or other less sophisticated bitmap-to-PostScript converters. .PP The amount of savings in the size of the output varies greatly depending on the characteristics of the input image. Input images with a small number of colors generally give better output because fewer colors generally means a larger average polygon size. If, however, the image was created with a utility that uses dithering to simulate more colors, .BR pnmtops will not generate smaller PostScript output, because the specific goal of dithering is to break up the large polygons that show up as "banding" in an image with few colors. .PP Thus, .BR pnmtops works best on line art or other non-true-color images. If you must use this utility on a photograph or other true-color image, you can get good results by following this procedure: .PP 1. Load the file into a utility, such as .BR xv that allows you to examine the color of individual pixels. .PP 2. Manually select colors from the image until you feel you have selected enough colors to represent the range of colors in the image. Acceptable results can usually be had with as few as 16 colors, while choosing 32 colors results in very good results. This is the step in which you balance final quality of the PostScript file's output against the size of the PostScript file. .PP 3. Using an image-editing utility such as .BR xpaint, or manually, create a .ppm file containing the colors you chose to act as a colormap when quantizing the image. If you create the mapfile manually, the file should have this format: .sp .RS +.2i .ta 1.0i 2.5i .nf \fR P3 \fI n\fR 1 \fR 255 \fI R1 G1 B1\fR \fI R2 G2 B2\fR \fR . \fR . \fR . \fI Rn Gn Bn\fR .fi .RE .sp In this file, \fIn\fR is the number of colors you chose. The \fIR\fR, \fIG\fR, and \fIB\fR, values are the red, green, and blue components of each color. .PP 4. Run your pnm file through the .BR ppmquant utility, like this: .sp ppmquant -map \fImapfile imagefile\fR > \fItemp.ppm\fR .sp .PP 5. Run .BR pnmtops on the resulting ppm file, \fItemp.ppm\fR in this example. .SH Options The following options may be used with .BR pnmtops : .TP .B -bg Specify a background color. If you do not specify one, one will be chosen via the pnm_backgroundxel() function. If you specify a background color, it should be the color which, within polygons that touch the edges of the image, accounts for the largest number of pixels. .TP .B -s Specify a scale factor. If you do not specify one, the image will be scaled to the largest size that fits within .25 inch margins. A scale factor of 1.0 results in an output resolution of 72 pixels per inch, or one point per pixel. .TP .B -l Specify that output should be in landscape mode. .TP .B -p Specify that output should be in portrait mode. This is the default orientation. .TP .B -eps Specify output as encapsulated PostScript instead of ordinary PostScript. .TP .B pnmfile Specify an input file. If you do not specify an input file, one will be read from standard input. .SH Bugs On occasion, automatic selection of a background color fails because pnm_backgroundxel() returns a color with one or more components in excess of the largest allowed value (the "levels" value in the pnm file). If that happens, choose a background color manually and specify it with the \fB-bg\fR flag. .sp This program assumes 8.5x11 inch paper. Using this program's output on printers that use different sizes of paper will either cause the output to run outside the printable area of the page, or will result in images that are not scaled to the largest size possible for the paper size. In either case, use the \fB-s\fR flag to specify a scale factor to compensate. .SH See Also ppmquant(1), giftoppm(1), pbm(5), pgm(5), ppm(5). .SH Author Jason Black, cloister@hhhh.org, March 27, 1997. pnmtops/README100644 5770 144 10725 6317065166 12747 0ustar cloisterusersThis README file applies to the pnmtops program by Jason Black, cloister@hhhh.org Purpose ------- Anyone who works with bitmapped graphics and with PostScript output devices has probably had to convert .gif, .jpeg, .tiff, or .ppm files to PostScript for printing. Such people are probably quite aware of how bitmapped graphics files converted into PostScript typically become very, very large PostScript files. The reason for this is that the native data format for bitmapped images in PostScript is very inefficient. For color images, typically six bytes per pixel are stored in the PostScript file as data for the "image" or "colorimage" PostScript operators. For small bitmaps this is not generally a problem. And for large true color images for which accurate color representation is essential, the native PostScript format is typically the best. However, very large PostScript files can easily overrun the physical memory constraints of many PostScript printers. PostScript printer memory overruns typically results in partial output---or no output at all---often with no warning or explanation from the printer. The primary purpose for the pnmtops utility, then, is to produce PostScript representations of bitmapped graphics files which are smaller than the standard ones. Pnmtops accepts any of image formats, pbm, pgm, and ppm, as input. These are often collectively referred to as the "Poskanzer" formats, after Jeff Poskanzer who created the original suite of pbm, pgm, and ppm manipulation utilities, or the "NetPBM" formats, after the "NetPBM" implementation of the Poskanzer utilities. Pnmtops achieves smaller PostScript files by taking advantage of the fact that for sufficiently large polygons (10 or more contiguous pixels of the same color, less if the polygons tend to be compact), it takes less postscript code to describe the outline of the polygon than it takes to describe the color of every pixel in the polygon. Therefore, by analyzing the input image in terms of polygons, and writing out complex polygons rather than PostScript bitmap data, pnmtops can create smaller PostScript files than other conversion utilities, sometimes much smaller. Because of pnmtops' dependence on polygons, it tends to work best on the following types of images: * line art * images with few colors * images that do *not* use dithering Pnmtops will work fine on true-color images as well, but the resulting PostScript files are not guaranteed to be smaller than the standard PostScript bitmap format. If you can sacrifice some color depth, either because you don't need it or because your printer can't represent color with as much distinction as is present in the image, then reducing the number of colors in the pnmfiles you give to pnmtops will result in smaller PostScript files than if you don't. This is a simple consequence of the fact that reducing the number of colors in an image tends to increase the average polygon size in the image. The manual page for pnmtops gives a procedure for reducing the color depth in an image in such a way as to create better input for pnmtops. Compiling and Installing ------------------------ This program should compile on any system that meets the following requirements: * has an ANSI compliant C compiler * has the pnm libraries and header files To compile this program: 1. extract the contents of the .tar file, if you have not already done so, into a working directory. 2. Edit the Makefile. In the Makefile, change the PNMDIR value to the full path of the directory on your system that contains the "pnm.h" header file. 3. If your pnm libraries are not in the standard search path for your compiler, usually /lib or /usr/lib, change the LIBDIR value to the full path of the directory containing the "libpnm.a" library. 4. Save the Makefile. 5. At the command prompt, type "make" To install this program: 1. After successful compilation, copy or more the resulting file, "pnmtops", to a directory in your path or to a standard directory for utilities such as this. /usr/bin, /usr/local/bin, and on some systems, /usr/bin/graphics are common places. 2. Copy or move pnmtops.1 into a directory that is in your manpath. /usr/man/man1 and /usr/local/man/man1 are common places. Availability ------------ Pnmtops is available from ftp://ftp.hhhh.org/pub/pnmtops/pnmtops.tar.gz Permission is granted to distribute this program and its source code, so long as the terms listed in the file "COPYING", which is distributed with the source code, are followed. pnmtops/Makefile100644 5770 144 607 6316675702 13467 0ustar cloisterusersCC = gcc CFLAGS = -g -Wall PNMDIR = /usr/include/gr LIBDIR = LIBS = -lpnm -lppm -lpgm -lpbm SRCS = main.c usage.c get_path.c floodfill.c parse_args.c write_ps.c OBJS = main.o usage.o get_path.o floodfill.o parse_args.o write_ps.o all: pnmtops .c.o: $(SRCS) $(CC) -c $(CFLAGS) -I$(PNMDIR) $< pnmtops: $(OBJS) pnmtops.h write_ps.h $(CC) -o $@ $(OBJS) -L$(LIBDIR) $(LIBS) clean: rm *.o pnmtops/pnmtops.h100644 5770 144 4314 6316672567 13725 0ustar cloisterusers/* pnmtops - convert a pnm formatted image to a polygon-based Adobe(R) PostScript(R) file. Copyright (C) 1997 Jason Black This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program 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 General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. March 27, 1997, Jason Black, cloister@hhhh.org */ #include /* my types: */ /* a linked list of points */ typedef struct _point { unsigned int x, y; struct _point *next; } point; /* linked list of paths. each has a color and a linked list of points */ typedef struct _path { xel color; point *vertices; struct _path *next; } path; typedef struct { int mode; /* flag: 0 = portrait, 1 = landscape */ int usercolor; /* flag: 0 = use pnm_backgroundxel. 1 = user supplied */ int format; /* returned by pnm_readpnm() */ xel basecolor; /* the background color */ float scale; /* user supplied scale. default is to compute this. */ int infilenum; /* argument number of input filename. -1 if none. */ int eps; /* flag: 1 = eps output, 0 = regular ps output */ } gvals; /* this macro relies on the variable "image" having that name */ #define PIXEL(i,j) ((image[j])[i]) /* this macro relies on the variable "mask" having that name */ #define MASK(i,j) ((mask[j])[i]) /* prototypes */ void main(int argc, char **argv); void usage(void); path *get_path(xel **image, int x, int y, int width, int height); void floodfill(xel **image, bit **mask, int i,int j, xel basecolor, int width, int height); void write_ps(path *paths, xel basecolor, int width, int height, int maxval, gvals *globals); void parse_args(int argc, char **argv, gvals *globals); pnmtops/main.c100644 5770 144 10702 6316664657 13163 0ustar cloisterusers#include #include #include #include "pnmtops.h" void main(int argc, char **argv) { FILE *infile = stdin; xel **image; /* the pnm file we're working on */ bit **mask; /* mask to store which pixels have been done and which haven't. */ /* uses PBM_BLACK as "undone" and PBM_WHITE as "done" */ xel basecolor; xelval maxval = PNM_MAXMAXVAL; int width = 0, height = 0, format = 0; int i = 0, j = 0; gvals globals; path *paths = NULL; /* the list of paths */ path *pathcursor = NULL; /* a cursor into it */ path *temppath; /* a temporary holding place for new paths */ /* they say you should call these... */ pbm_init(&argc, argv); pnm_init(&argc, argv); parse_args(argc,argv,&globals); /* make sure they're telling us stuff that makes sense: */ /* check the scale factor */ if(!(globals.scale > 0.0) && !(globals.scale == -1.0)) { fprintf(stderr,"Error: you have specified an invalid scale factor.\n"); usage(); } /* open the proper input file */ if(globals.infilenum == -1) infile = stdin; else { infile = fopen(argv[globals.infilenum],"r"); if(infile == NULL) { fprintf(stderr,"Error: could not open %s for reading\n", argv[globals.infilenum]); exit(1); } } /* read in the image */ image = pnm_readpnm(infile, &width, &height, &maxval, &format); fclose(infile); globals.format = format; if(globals.usercolor) basecolor = globals.basecolor; else basecolor = pnm_backgroundxel(image, width, height, maxval, format); if(globals.usercolor && /* if the user supplied the background color */ ((PPM_GETR(basecolor) == PPM_GETG(basecolor)) && /* and it's greyscale */ (PPM_GETR(basecolor) == PPM_GETB(basecolor))) && (format == PPM_FORMAT || format == RPPM_FORMAT))/* and the image is color */ fprintf(stderr,"Warning: you have specified a greyscale background color with a color image.\n"); if(PPM_GETR(basecolor) > maxval || PPM_GETG(basecolor) > maxval || PPM_GETB(basecolor) > maxval) { fprintf(stderr,"Error: your background color is invalid.\n"); fprintf(stderr,"One or more components of the color exceeds the maximum red, green, blue, or\n"); fprintf(stderr,"grey values in the image. The components of your background color must not\n"); fprintf(stderr,"exceed %d for this image.\n", maxval); fprintf(stderr,"background: %d %d %d, maxval: %d\n", PPM_GETR(basecolor), PPM_GETG(basecolor), PPM_GETB(basecolor), maxval); exit(1); } /* get down to business: */ /* allocate the mask, now that we know how big to make it */ mask = pbm_allocarray(width,height); /* make sure the mask is empty. this is probably not necessary, but i don't * have any documentation which guarantees that the pbm array gets initialized * to anything in particular */ for(j = 0; j < height; j++) for(i = 0; i < width; i++) MASK(i,j) = PBM_BLACK; /* floodfill the exterior background just to get it marked as done. this * means running around the perimiter of the image, and floodfilling any * undone pixels of the background color. doing this means not having to make * a potentially very complex polygon out of the basecolor pixels that are on * the perimiter of the image */ for(i = 0; i < width; i++) { if(MASK(i,0) == PBM_BLACK && PNM_EQUAL(PIXEL(i,0),basecolor)) floodfill(image,mask,i,0,basecolor,width,height); if(MASK(i,height-1) == PBM_BLACK && PNM_EQUAL(PIXEL(i,height-1),basecolor)) floodfill(image,mask,i,height-1,basecolor,width,height); } for(j = 0; j < height; j++) { if(MASK(0,j) == PBM_BLACK && PNM_EQUAL(PIXEL(0,j),basecolor)) floodfill(image,mask,0,j,basecolor,width,height); if(MASK(width-1,j) == PBM_BLACK && PNM_EQUAL(PIXEL(width-1,j),basecolor)) floodfill(image,mask,width-1,j,basecolor,width,height); } /* now begins the real work: */ for(j = 0; j < height; j++) /* loop over the image */ for(i = 0; i < width; i++) if(MASK(i,j) == PBM_BLACK) /* if you encounter an undone pixel */ { temppath = get_path(image,i,j,width,height); /* identify the polygon */ floodfill(image,mask,i,j,basecolor,width,height); /* mark it as done */ if(paths == NULL) /* one time initialization */ paths = pathcursor = temppath; else /* append the polygon to the list and advance the cursor */ { pathcursor->next = temppath; pathcursor = pathcursor->next; } } /* write all the paths out as postscript */ write_ps(paths, basecolor, width, height, maxval, &globals); exit(0); } pnmtops/usage.c100644 5770 144 2527 6316674536 13326 0ustar cloisterusers#include #include "pnmtops.h" /* usage info when user gives bad input */ static char *help[] = { "Usage:\n", " ppmtops [-bg ] [-eps] [-s ] [-l] [-p] [pnmfile]\n", "\n", " -bg: Specify a background color. must either be a single number\n", " specifying a greyscale value, or three numbers specifying an RGB\n", " color. The numbers must always be between 0 and the maximum value\n", " for the grey, red, green, or blue levels in the image.\n", " -s: Specify a scale factor. Single pixels in the input image will\n", " become points big in the output image. If you do not\n", " provide a scale factor, the image will be scaled to the largest\n", " size that fits within 8x10.5 inches (or 10.5x8 inches in landscape\n", " mode).\n" " -eps: Specify output as encapsulated PostScript\n", " -l: Specify landscape mode.\n", " -p: Specify portrait mode. Portrait mode is the default.\n", " [pnmfile]: Specify the name of a pnm file on the command line. If you\n", " not specify a pnmfile on the command line, one will be read from\n", " standard input.\n\n", "Example:\n", " pnmtops -bg 0 255 255 -l -s 20.0 image.ppm\n", "\0" }; void usage() { int i=0; while(help[i][0] != '\0') fprintf(stderr,help[i++],PNM_MAXMAXVAL); /* another cheap hack */ exit(1); } pnmtops/get_path.c100644 5770 144 4260 6312176321 13772 0ustar cloisterusers#include #include "pnmtops.h" static int move_vector[4][2] = { { 1, 0}, /* right (dir == 0) */ { 0, 1}, /* down (dir == 1) */ {-1, 0}, /* left (dor == 2) */ { 0,-1} }; /* up (dir == 3) */ static int mask_vectors[4][2][2] = { { { 1,-1}, { 1, 0} }, { { 1, 1}, { 0, 1} }, { {-1, 1}, {-1, 0} }, { {-1,-1}, { 0,-1} } }; /* returns a linked list of points */ path *get_path(xel **image, int x, int y, int width, int height) { path *p; point *cursor; int init_x = x, init_y = y, init_dir = 0, dir = 0; int tx = 0, ty = 0; int mask1 = 0, mask2 = 0; int newpoint = 0; /* a flag */ /* create and initialize the path and its first point */ p = (path *)malloc(sizeof(path)); p->color = PIXEL(x,y); /* what color is this polygon? */ p->vertices = cursor = (point *)malloc(sizeof(point)); p->next = NULL; cursor->x = init_x; cursor->y = init_y; cursor->next = NULL; do { /* check the relevant pixels around (x,y) */ tx = x+mask_vectors[dir][0][0]; ty = y+mask_vectors[dir][0][1]; mask1 = (tx >= 0 && tx < width && ty >= 0 && ty < height) ? PNM_EQUAL(p->color,PIXEL(tx,ty)) : 0; tx = x+mask_vectors[dir][1][0]; ty = y+mask_vectors[dir][1][1]; mask2 = (tx >= 0 && tx < width && ty >= 0 && ty < height) ? PNM_EQUAL(p->color,PIXEL(tx,ty)) : 0; if(mask2 == 0) /* turn right */ dir = (dir+1) % 4; else if(mask1 == 0) /* advance straight ahead */ { x += move_vector[dir][0]; y += move_vector[dir][1]; newpoint = 1; /* remember that we're on a new point */ } else /* around the corner to the left and turn left */ { x += mask_vectors[dir][0][0]; /* here's the around the corner */ y += mask_vectors[dir][0][1]; dir = (dir+3) % 4; /* here's the left turn (3 rights == 1 left) */ newpoint = 1; /* remember that we're on a new point */ } if(newpoint) { /* do we need to add a new point to the path? */ newpoint = 0; /* reset the flag */ cursor->next = (point *)malloc(sizeof(point)); cursor = cursor->next; cursor->x = x; cursor->y = y; cursor->next = NULL; } } while(x != init_x || y != init_y || dir != init_dir); return p; } pnmtops/write_ps.h100644 5770 144 4100 6316672117 14041 0ustar cloisterusers/* contstant postscript code used by pnmtops */ /* a preamble for color images */ static char *colorpreamble[] = { /* shorthand procedure defs: */ "/r {rlineto} def\n", "/B {newpath moveto setrgbcolor} def\n", /* begin a path: r g b x y B - */ "/R {0 r} def\n", /* move some to the right: int R - */ "/L {-1 mul 0 r} def\n", /* move some to the left: int L - */ "/U {-1 mul 0 exch r} def\n", /* move up some: int U - */ "/D {0 exch r} def\n", /* move down some: int D - */ "/W {1 1 3 -1 roll {pop 0 1 r 1 0 r} for} def\n", /* down and right */ "/X {1 1 3 -1 roll {pop -1 0 r 0 1 r} for} def\n", /* left and down */ "/Y {1 1 3 -1 roll {pop 0 -1 r -1 0 r} for} def\n", /* up and left */ "/Z {1 1 3 -1 roll {pop 1 0 r 0 -1 r} for} def\n", /* right and up */ "/E {closepath fill} def\n", /* finish off a path: - E - */ "/S {B 1 R 1 D 1 L E} def\n", /* special case for single point paths */ /* start things off with a new context */ "gsave\n", "\0" }; /* a preamble for grayscale images; same as color one except for 'B' */ static char *graypreamble[] = { "/r {rlineto} def\n", "/B {newpath moveto setgray} def\n", /* begin a path: grayvalue x y B - */ "/R {0 r} def\n", /* move some to the right: int R - */ "/L {-1 mul 0 r} def\n", /* move some to the left: int L - */ "/U {-1 mul 0 exch r} def\n", /* move up some: int U - */ "/D {0 exch r} def\n", /* move down some: int D - */ "/W {1 1 3 -1 roll {pop 0 1 r 1 0 r} for} def\n", /* down and right */ "/X {1 1 3 -1 roll {pop -1 0 r 0 1 r} for} def\n", /* left and down */ "/Y {1 1 3 -1 roll {pop 0 -1 r -1 0 r} for} def\n", /* up and left */ "/Z {1 1 3 -1 roll {pop 1 0 r 0 -1 r} for} def\n", /* right and up */ "/E {closepath fill} def\n", /* finish off a path: - E - */ "/S {B 1 R 1 D 1 L E} def\n", /* special case for single point paths */ /* start things off with a new context */ "gsave\n", "\0" }; static char *postamble[] = { "grestore showpage\n", "\0" }; pnmtops/write_ps.c100644 5770 144 17720 6316673744 14077 0ustar cloisterusers#include #include "pnmtops.h" #include "write_ps.h" /* lots of data specific to this function */ void filter_write(char direction); void nz_printf(int count, char direction); void print_float(float f); void write_strings(char **strings); void write_ps(path *paths, xel basecolor, int width, int height, int maxval, gvals *globals) { int oldx = 0, oldy = 0, dx = 0, dy = 0; int mode = globals->mode; int format = globals->format; int eps = globals->eps; float scale = globals->scale; point *pointcursor; /* use the specified scale, or find the largest scale that fits in 8"x10.5" */ if(scale < 0.0) { if(mode == 0) /* portrait mode */ scale = min((8.0*72.0/(float)width),(10.5*72.0/(float)height)); else /* landscape mode */ scale = min((8.0*72.0/(float)height),(10.5*72.0/(float)width)); } /* write out the header */ printf("%%!PS-Adobe-3.0"); if(eps) printf(" EPSF-3.0\n"); else printf("\n"); printf("%%%%Creator: pnmtops -- a product of HHHH Software\n"); if(mode == 0) /* portrait mode */ printf("%%%%BoundingBox: %d %d %d %d\n", 18,18, 18+(int)((float)width*scale),18+(int)((float)height*scale)); else /* landscape mode */ printf("%%%%BoundingBox: %d %d %d %d\n", 594-(int)((float)height*scale), 18, /* only works with 8.5x11 */ 594, 18+(int)((float)width*scale)); /* inch paper */ printf("%%%%BeginDocument\n"); /* write out shorthand procedure defs: */ if(format == PPM_FORMAT || format == RPPM_FORMAT) write_strings(colorpreamble); else write_strings(graypreamble); /* write out the variable header */ if(mode == 1) /* landscape mode */ printf("8.5 72 mul 0 translate 90 rotate\n"); /* only works with 8.5x11 */ printf("18 18 translate\n"); /* leave 0.25 inch margins */ printf("%f %f scale\n",scale,scale); /* scale the image */ printf("0 %d translate 1 -1 scale\n",height);/* flip the y axis over to */ /* match normal PPM coordinates */ /* draw the background rectangle */ if(format == PPM_FORMAT || format == RPPM_FORMAT) { print_float((float)PPM_GETR(basecolor)/(float)maxval);/* smart print the */ print_float((float)PPM_GETG(basecolor)/(float)maxval);/* red, green, and */ print_float((float)PPM_GETB(basecolor)/(float)maxval);/* blue components */ printf("setrgbcolor " "newpath 0 0 moveto %d 0 lineto %d %d lineto 0 %d lineto " "closepath fill\n", width, width, height, height); } else { /* the grey value is in the blue component */ print_float((float)PPM_GETB(basecolor)/(float)maxval); printf("setgray " "newpath 0 0 moveto %d 0 lineto %d %d lineto 0 %d lineto " "closepath fill\n", width, width, height, height); } while(paths != NULL) /* converts all paths to postscript */ { pointcursor = paths->vertices; /* start a new path */ if(format == PPM_FORMAT || format == RPPM_FORMAT) { print_float((float)PPM_GETR(paths->color)/(float)maxval); print_float((float)PPM_GETG(paths->color)/(float)maxval); print_float((float)PPM_GETB(paths->color)/(float)maxval); } else { print_float((float)PPM_GETB(paths->color)/(float)maxval); } printf("%d %d ", pointcursor->x, pointcursor->y); oldx = pointcursor->x; oldy = pointcursor->y; pointcursor = pointcursor->next; if(pointcursor == NULL) /* special case: single-point path */ printf("S\n"); else /* normal case: finish off the path */ { printf("B "); /* now we know it isn't a single-point path */ while(pointcursor != NULL) { dx = pointcursor->x - oldx; /* which way are we moving? */ dy = pointcursor->y - oldy; /* inefficient but so what? */ if(dx == 1 && dy == 0) filter_write('r'); if(dx == 1 && dy == 1) filter_write('w'); if(dx == 0 && dy == 1) filter_write('d'); if(dx == -1 && dy == 1) filter_write('x'); if(dx == -1 && dy == 0) filter_write('l'); if(dx == -1 && dy == -1) filter_write('y'); if(dx == 0 && dy == -1) filter_write('u'); if(dx == 1 && dy == -1) filter_write('z'); oldx = pointcursor->x; oldy = pointcursor->y; pointcursor = pointcursor->next; } filter_write('e'); /* finish off the path */ } paths = paths->next; /* advance to the next one */ } write_strings(postamble); printf("%%%%EndDocument\n"); } void filter_write(char direction) { static int count=1; static char last='r'; int newcount = 1; if(direction == last) { count++; return; } else if(direction == 'e') { if(last != 'u') /* if the final direction is 'u', it can be thrown away */ nz_printf(count,last-32); /* last-32 is an ascii-hack */ printf("E\n"); direction = last = 'r'; count = 1; return; } else { newcount = 1;/* some curcumstances set newcount to something else. */ switch(last) /* write out the previous direction, and sometimes */ { /* an initializer to set up the current direction */ /* these are symmetric under rotation, as you'd expect, the letters are thus: * y u z * l . r * x d w */ case 'r': if(direction == 'z') nz_printf(count-1,'R'); else nz_printf(count,'R'); if(direction == 'd') newcount = 2; if(direction == 'x') nz_printf(1,'D'); if(direction == 'l') { nz_printf(1,'D'); newcount = 2; } break; case 'w': nz_printf(count,'W'); if(direction == 'z') { nz_printf(1,'U'); newcount = 0; } if(direction == 'd') newcount = 2; if(direction == 'x') nz_printf(1,'D'); if(direction == 'l') { nz_printf(1,'D'); newcount = 2; } break; case 'd': if(direction == 'w') nz_printf(count-1,'D'); else nz_printf(count,'D'); if(direction == 'l') newcount = 2; if(direction == 'y') nz_printf(1,'L'); if(direction == 'u') { nz_printf(1,'L'); newcount = 2; } break; case 'x': nz_printf(count,'X'); if(direction == 'w') { nz_printf(1,'R'); newcount = 0; } if(direction == 'l') newcount = 2; if(direction == 'y') nz_printf(1,'L'); if(direction == 'u') { nz_printf(1,'L'); newcount = 2; } break; case 'l': if(direction == 'x') nz_printf(count-1,'L'); else nz_printf(count,'L'); if(direction == 'u') newcount = 2; if(direction == 'z') nz_printf(1,'U'); if(direction == 'r') { nz_printf(1,'U'); newcount = 2; } break; case 'y': nz_printf(count,'Y'); if(direction == 'x') { nz_printf(1,'D'); newcount = 0; } if(direction == 'u') newcount = 2; if(direction == 'z') nz_printf(1,'U'); if(direction == 'r') { nz_printf(1,'U'); newcount = 2; } break; case 'u': if(direction == 'y') nz_printf(count-1,'U'); else nz_printf(count,'U'); if(direction == 'r') newcount = 2; if(direction == 'w') nz_printf(1,'R'); if(direction == 'd') { nz_printf(1,'R'); newcount = 2; } break; case 'z': nz_printf(count,'Z'); if(direction == 'y') { nz_printf(1,'L'); newcount = 0; } if(direction == 'r') newcount = 2; if(direction == 'w') nz_printf(1,'R'); if(direction == 'd') { nz_printf(1,'R'); newcount = 2; } break; } last = direction; count = newcount; } } void nz_printf(int count, char direction) /* only print if it's worthwhile */ { if(count) printf("%d %c ",count,direction); } void print_float(float f) /* print 1.0 as "1", 0.0 as "0", everything else */ { /* as ".x" or ".xx" where the x's are digits */ if(f == 1.0) printf("1 "); else if(f == 0.0) printf("0 "); else /* not an integer. */ { int i = (int)(100*f); printf("."); if(i < 10) /* print a leading 0 then the single digit value */ { printf("0"); printf("%d ",i); } else if(i%10 == 0) /* don't print trailing 0 */ printf("%d ",i/10); else /* normal, two-digit case */ printf("%d ",i); } } void write_strings(char *strings[]) { int i = 0; while(strings[i][0] != '\0') printf(strings[i++]); } pnmtops/floodfill.c100644 5770 144 4105 6313062412 14143 0ustar cloisterusers#include #include "pnmtops.h" /* prototype for local function */ void enqueue(int i, int j, point **queue, point **tail); void floodfill(xel **image, bit **mask, int i, int j, xel basecolor, int width, int height) { /* a queue of points */ point *queue = NULL; /* various pointers into the queue: */ point *cursor = NULL, *tail = NULL, *temp = NULL; int x = 0, y = 0; xel polycolor; /* the color of this polygon */ polycolor = PIXEL(i,j); /* remember what color we're filling against */ enqueue(i,j,&queue,&tail); /* initialize */ MASK(i,j) = PBM_WHITE; /* mark start point as done */ cursor = queue; while(cursor != NULL) { x = cursor->x; y = cursor->y; /* enqueue applicable neighbors and mark them. applicable neighbors * are undone pixels of the same color as the polygon. * marking them now rather than when they come up in the queue * means never having to worry about points getting enqueued twice */ if(x < width-1 && MASK(x+1,y) == PBM_BLACK && PNM_EQUAL(PIXEL(x+1,y),polycolor)) { enqueue(x+1,y,&queue,&tail); MASK(x+1,y) = PBM_WHITE; } if(y < height-1 && MASK(x,y+1) == PBM_BLACK && PNM_EQUAL(PIXEL(x,y+1),polycolor)) { enqueue(x,y+1,&queue,&tail); MASK(x,y+1) = PBM_WHITE; } if(x > 0 && MASK(x-1,y) == PBM_BLACK && PNM_EQUAL(PIXEL(x-1,y),polycolor)) { enqueue(x-1,y,&queue,&tail); MASK(x-1,y) = PBM_WHITE; } if(y > 0 && MASK(x,y-1) == PBM_BLACK && PNM_EQUAL(PIXEL(x,y-1),polycolor)) { enqueue(x,y-1,&queue,&tail); MASK(x,y-1) = PBM_WHITE; } /* free this point and advance to the next point */ temp = cursor; cursor = cursor->next; free(temp); } } /* adds a new point to the tail of the queue */ void enqueue(int i, int j, point **queue, point **tail) { if((*tail) == NULL) (*queue) = (*tail) = (point *)malloc(sizeof(point)); else { (*tail)->next = (point *)malloc(sizeof(point)); (*tail) = (*tail)->next; } (*tail)->x = i; (*tail)->y = j; (*tail)->next = NULL; } pnmtops/parse_args.c100644 5770 144 6400 6316664526 14340 0ustar cloisterusers#include #include #include "pnmtops.h" void parse_args(int argc, char **argv, gvals *globals) { int i = 0; int r = 0, g = 0, b = 0; char *endptr; /* used by strtol() */ int parsed = 0; /* used to detect whether to treat an arg as a filename */ /* establish defaults */ globals->mode = 0; /* portrait mode */ globals->usercolor = 0; globals->scale = -1.0; /* an invalid value means to calculate it */ globals->infilenum = -1; /* -1 means no filename specified, so be a filter */ globals->eps = 0; /* default is ordinary postscript */ /* at the start of each pass through this loop, 'i' should point to the last * argument that was fully dealt with */ do { i++; parsed = 0; if(!strncmp(argv[i],"-h",2)) /* user wants help */ usage(); if(!strncmp(argv[i],"-l",2)) { globals->mode = 1; /* landscape mode */ parsed = 1; } if(!strncmp(argv[i],"-p",2)) { globals->mode = 0; /* portrait mode */ parsed = 1; } if(!strncmp(argv[i],"-eps",4)) { globals->eps = 1; parsed = 1; } if(!strncmp(argv[i],"-s",2)) /* scale factor */ { if(argc-1 <= i+1) /* no scale factor present */ { fprintf(stderr,"Error: no scale factor present after \"-s\".\n"); usage(); } i++; globals->scale = (float)strtod(argv[i],&endptr); if(endptr == argv[i]) /* bad scale factor given */ { fprintf(stderr,"Error: no scale factor present after \"-s\".\n"); usage(); } parsed = 1; } if(!strncmp(argv[i],"-bg",3)) /* user is specifying a background color */ { if(argc-1 <= i+1) /* there has to be at least one more arg */ { fprintf(stderr, "Error: -bg must be followed by a color specification.\n"); usage(); } i++; r = strtol(argv[i],&endptr,10); if(endptr == argv[i]) /* argv[i] is not a number */ { fprintf(stderr, "Error: -bg must be followed by a color specification.\n"); usage(); } i++; if(i == argc) /* no more args available, must be a greyscale */ { PPM_ASSIGN(globals->basecolor,r,r,r); globals->usercolor = 1; parsed = 1; } else if(argc-1 >= i+1) /* are there enough args for a 'g' and a 'b'? */ { g = strtol(argv[i],&endptr,10); if(endptr == argv[i]) /* no g value? must be greyscale */ { PPM_ASSIGN(globals->basecolor,r,r,r); globals->usercolor = 1; i--; parsed = 1; } else { i++; b = strtol(argv[i],&endptr,10); if(endptr == argv[i]) { fprintf(stderr, "Error: -bg must be followed by a color specification.\n"); usage(); } PPM_ASSIGN(globals->basecolor,r,g,b); globals->usercolor = 1; parsed = 1; } } else/* there was an R value, but there weren't enough args for color */ { PPM_ASSIGN(globals->basecolor,r,r,r); globals->usercolor = 1; i--; parsed = 1; } } /* default interpretation of an argument not already processed is that it is * an input filename */ if(!parsed) { if(globals->infilenum != -1) /* can't have two filenames! */ { fprintf(stderr,"Error: Both \"%s\" and \"%s\" could be filenames. Specify only one filename.\n",argv[globals->infilenum],argv[i]); usage(); } globals->infilenum = i; } } while(i < argc-1); }