00001 /* boxLump - This will lump together boxes that overlap into the smallest 00002 * box that encompasses the overlap. It will put other boxes that 00003 * fit in the encompassing box in there too. 00004 * It works by projecting the box list along one dimension at a 00005 * time looking for gaps between boxes. This is similar in function 00006 * to boxFindClumps, but a bit less precise, and quite a bit faster. 00007 * in some important cases. */ 00008 00009 #ifndef BOXLUMP_H 00010 #define BOXLUMP_H 00011 00012 #ifndef BOXCLUMP_H 00013 #include "boxClump.h" 00014 #endif 00015 00016 struct boxClump *boxLump(struct boxIn **pBoxList); 00017 /* Convert list of boxes to a list of lumps. The lumps 00018 * are a smaller number of boxes that between them contain 00019 * all of the input boxes. Note that 00020 * the original boxList is overwritten as the boxes 00021 * are moved from it to the lumps. */ 00022 00023 #endif /* BOXLUMP_H */ 00024 00025
1.5.2