Lines Matching refs:box
40 * Next, the color-selection step begins with a box representing the whole
41 * color space, and repeatedly splits the "largest" remaining box until we
43 * remaining box becomes one of the possible output colors.
51 * the "largest" box and deciding where to cut it. The particular policies
259 /* The bounds of the box (inclusive); expressed as histogram indexes */
263 /* The volume (actually 2-norm) of the box */
265 /* The number of nonzero histogram cells within this box */
267 } box;
269 typedef box * boxptr;
274 /* Find the splittable box with the largest color population */
294 /* Find the splittable box with the largest (scaled) volume */
314 /* Shrink the min/max bounds of a box to enclose only nonzero elements, */
396 /* Update box volume.
399 * a box is splittable iff norm > 0.
409 /* Now scan remaining volume of box and compute population */
426 /* Repeatedly select and split the largest box until we have enough boxes */
433 /* Select box to split.
443 b2 = &boxlist[numboxes]; /* where new box will go */
444 /* Copy the color bounds to the new box. */
447 /* Choose which axis to split the box on.
466 /* Choose split point along selected axis, and update box bounds.
468 * (Since the box has been shrunk to minimum volume,
470 * Note that lb value is max for lower box, so must be < old max.
500 /* Compute representative color for a box, put it in colormap[icolor] */
546 /* Allocate workspace for box list */
548 ((j_common_ptr) cinfo, JPOOL_IMAGE, desired_colors * SIZEOF(box));
549 /* Initialize one box containing whole space */
559 /* Perform median-cut to produce final box list */
561 /* Compute the representative color for each box, fill colormap */
623 /* log2(histogram cells in update box) for each axis; this can be adjusted */
628 #define BOX_C0_ELEMS (1<<BOX_C0_LOG) /* # of hist cells in update box */
648 /* Locate the colormap entries close enough to an update box to be candidates
649 * for the nearest entry to some cell(s) in the update box. The update box
664 /* Compute true coordinates of update box's upper corner and center.
678 * 1. its minimum squared-distance to any point in the update box
679 * (zero if color is within update box);
680 * 2. its maximum squared-distance to any point in the update box.
681 * Both of these can be found by considering only the corners of the box.
761 /* Now we know that no cell in the update box is more than minmaxdist
763 * within minmaxdist of some part of the box need be considered.
777 /* Find the closest colormap entry for each cell in the update box,
781 * find the distance from a colormap entry to successive cells in the box.
796 /* Initialize best-distance for each cell of the update box */
802 * compute its distance to the center of each cell in the box.
824 /* Now loop over all cells in box, updating distance per Thomas method */
856 /* Fill the inverse-colormap entries in the update box that contains */
862 int minc0, minc1, minc2; /* lower left corner of update box */
872 /* Convert cell coordinates to update box ID */
877 /* Compute true coordinates of update box's origin corner.
886 * for the nearest entry to some cell in the update box.