version 1, including all changes.
.
Rev |
Author |
# |
Line |
1 |
perry |
1 |
pnmmontage |
|
|
2 |
!!!pnmmontage |
|
|
3 |
NAME |
|
|
4 |
SYNOPSIS |
|
|
5 |
DESCRIPTION |
|
|
6 |
OPTIONS |
|
|
7 |
NOTES |
|
|
8 |
SEE ALSO |
|
|
9 |
AUTHOR |
|
|
10 |
---- |
|
|
11 |
!!NAME |
|
|
12 |
|
|
|
13 |
|
|
|
14 |
pnmmontage - create a montage of portable anymaps |
|
|
15 |
!!SYNOPSIS |
|
|
16 |
|
|
|
17 |
|
|
|
18 |
__pnmmontage__ [[__-?__|__-help__] |
|
|
19 |
[[__-header=__''headerfile''] |
|
|
20 |
[[__-quality=__''n''] [[__-prefix=__''prefix''] |
|
|
21 |
[[__-0__|__-1__|__-2__|__...__|__-9__] |
|
|
22 |
pnmfile''...'' |
|
|
23 |
!!DESCRIPTION |
|
|
24 |
|
|
|
25 |
|
|
|
26 |
Packs images of differing sizes into a minimum-area |
|
|
27 |
composite image, optionally producing a C header file with |
|
|
28 |
the locations of the subimages within the composite |
|
|
29 |
image. |
|
|
30 |
!!OPTIONS |
|
|
31 |
|
|
|
32 |
|
|
|
33 |
__-?, -help__ |
|
|
34 |
|
|
|
35 |
|
|
|
36 |
Displays a (very) short usage message. |
|
|
37 |
|
|
|
38 |
|
|
|
39 |
__-header__ |
|
|
40 |
|
|
|
41 |
|
|
|
42 |
Tells __pnmmontage__ to write a C header file of the |
|
|
43 |
locations of the original images within the packed image. |
|
|
44 |
Each original image generates four #defines within the |
|
|
45 |
packed file: xxxX, xxxY, xxxSZX, and xxxSZY, where xxx is |
|
|
46 |
the name of the file, converted to all uppercase. The |
|
|
47 |
#defines OVERALLX and OVERALLY are also produced, specifying |
|
|
48 |
the total size of the montage image. |
|
|
49 |
|
|
|
50 |
|
|
|
51 |
__-prefix__ |
|
|
52 |
|
|
|
53 |
|
|
|
54 |
Tells __pnmmontage__ to use the specified prefix on all |
|
|
55 |
of the #defines it generates. |
|
|
56 |
|
|
|
57 |
|
|
|
58 |
__-quality__ |
|
|
59 |
|
|
|
60 |
|
|
|
61 |
Before attempting to place the subimages, __pnmmontage__ |
|
|
62 |
will calculate a minimum possible area for the montage; this |
|
|
63 |
is either the total of the areas of all the subimages, or |
|
|
64 |
the width of the widest subimage times the height of the |
|
|
65 |
tallest subimage, whichever is greater. __pnmmontage__ |
|
|
66 |
then initiates a problem-space search to find the best |
|
|
67 |
packing; if it finds a solution that is (at least) as good |
|
|
68 |
as the minimum area times the quality as a percent, it will |
|
|
69 |
break out of the search. Thus, __-q 100__ will find the |
|
|
70 |
best possible solution; however, it may take a very long |
|
|
71 |
time to do so. The default is __-q 200.__ |
|
|
72 |
|
|
|
73 |
|
|
|
74 |
__-0, -1, ... -9__ |
|
|
75 |
|
|
|
76 |
|
|
|
77 |
These options control the quality at a higher level than |
|
|
78 |
__-q; -0__ is the worst quality (literally pick the first |
|
|
79 |
solution found), while __-9__ is the best quality |
|
|
80 |
(perform an exhaustive search of problem space for the |
|
|
81 |
absolute best packing). The higher the number, the slower |
|
|
82 |
the computation. The default is __-5.__ |
|
|
83 |
!!NOTES |
|
|
84 |
|
|
|
85 |
|
|
|
86 |
Using __-9__ is excessively slow on all but the smallest |
|
|
87 |
image sets. If the anymaps differ in maxvals, then |
|
|
88 |
pnmmontage will pick the smallest maxval which is evenly |
|
|
89 |
divisible by each of the maxvals of the original |
|
|
90 |
images. |
|
|
91 |
!!SEE ALSO |
|
|
92 |
|
|
|
93 |
|
|
|
94 |
pnmcat(1), pnmindex(1), pnm(5), |
|
|
95 |
pam(5), pbm(5), pgm(5), |
|
|
96 |
ppm(5) |
|
|
97 |
!!AUTHOR |
|
|
98 |
|
|
|
99 |
|
|
|
100 |
Copyright (C) 2000 by Ben Olmstead. |
|
|
101 |
---- |