summary refs log tree commit diff
path: root/pnmmontage.html
blob: 7273cb93f217aa56dfd5e76664449a7906e5802c (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML><HEAD><TITLE>Pnmmontage User Manual</TITLE></HEAD>
<BODY>
<H1>pnmmontage</H1>
Updated: 31 December 2000
<BR>
<A HREF="#index">Table Of Contents</A>

<A NAME="lbAB">&nbsp;</A>
<H2>NAME</H2>

pnmmontage - create a montage of PNM images

<A NAME="lbAC">&nbsp;</A>
<H2>SYNOPSIS</H2>

<B>pnmmontage</B>

[<B>-header=</B><I>headerfile</I>]

[<B>-quality=</B><I>n</I>]

[<B>-prefix=</B><I>prefix</I>]

[<B>-0</B>|<B>-1</B>|<B>-2</B>|<B>...</B>|<B>-9</B>]

<i>pnmfile</I>...

<A NAME="lbAD">&nbsp;</A>
<H2>DESCRIPTION</H2>

<p>This program is part of <a href="index.html">Netpbm</a>.

<p><b>pnmmontage</b> packs images of differing sizes into a
minimum-area composite image, optionally producing a C header file
with the locations of the subimages within the composite image.

<A NAME="lbAE">&nbsp;</A>
<H2>OPTIONS</H2>

<DL COMPACT>

<DT><B>-header</B>

<DD>Tells <B>pnmmontage</B> to write a C header file of the locations
of the original images within the packed image.  Each original image
generates four #defines within the packed file: xxxX, xxxY, xxxSZX,
and xxxSZY, where xxx is the name of the file, converted to all
uppercase.  The ouput also includes #defines OVERALLX and OVERALLY, which
specifies the total size of the montage image.

<DT><B>-prefix</B>

<DD>Tells <B>pnmmontage</B> to use the specified prefix on all of the
#defines it generates.

<DT><B>-quality</B>

<DD>Before attempting to place the subimages, <B>pnmmontage</B> will
calculate a minimum possible area for the montage; this is either the
total of the areas of all the subimages, or the width of the widest
subimage times the height of the tallest subimage, whichever is
greater.  <B>pnmmontage</B> then initiates a problem-space search to
find the best packing; if it finds a solution that is (at least) as
good as the minimum area times the quality as a percent, it will break
out of the search.  Thus, <B>-q 100</B> will find the best possible
solution; however, it may take a very long time to do so.  The default
is <B>-q 200.</B>

<DT><B>-0</b>, <b>-1</b>, ... <b>-9</B>

<DD>These options control the quality at a higher level than
<B>-q</B>; <B>-0</B> is the worst quality (literally pick the first
solution found), while <B>-9</B> is the best quality (perform an
exhaustive search of problem space for the absolute best packing).
The higher the number, the slower the computation.  The default is
<B>-5</B>.

</DL>
<A NAME="lbAF">&nbsp;</A>
<H2>NOTES</H2>

<p>Using <B>-9</B> is excessively slow on all but the smallest image
sets.  If the anymaps differ in maxvals, then pnmmontage will pick the
smallest maxval which is evenly divisible by each of the maxvals of
the original images.

<A NAME="lbAG">&nbsp;</A>
<H2>SEE ALSO</H2>

<B><A HREF="pnmcat.html">pnmcat</A></B>,

<B><A HREF="pnmindex.html">pnmindex</A></B>,

<B><A HREF="pnm.html">pnm</A></B>,

<B><A HREF="pam.html">pam</A></B>,

<B><A HREF="pbm.html">pbm</A></B>,

<B><A HREF="pgm.html">pgm</A></B>,

<B><A HREF="ppm.html">ppm</A></B>

<A NAME="lbAH">&nbsp;</A>
<H2>AUTHOR</H2>

Copyright (C) 2000 by Ben Olmstead.

<HR>
<A NAME="index">&nbsp;</A>
<H2>Table Of Contents</H2>
<UL>
<LI><A HREF="#lbAB">NAME</A>
<LI><A HREF="#lbAC">SYNOPSIS</A>
<LI><A HREF="#lbAD">DESCRIPTION</A>
<LI><A HREF="#lbAE">OPTIONS</A>
<LI><A HREF="#lbAF">NOTES</A>
<LI><A HREF="#lbAG">SEE ALSO</A>
<LI><A HREF="#lbAH">AUTHOR</A>
</UL>
</BODY>
</HTML>