I choped and chagned the code a little to make it a little easier to understand. Normally i have conditions to select which of the regions (I created a class called Iregion to represent each region) will be partitioned.
Sorry about the codes layout, im not sure how to post on these sites.
Code:
public void partitionReg(Iregion r)
{
int wFrom = r.getW();
Yeah, i can break the image into quadrants, but when i call the method again recursively, it then keeps breaking the top left quadrant without reguard for the rest. Really bothering me as im normally good at java programming (its c# im using but almost identical) :-(....
Hi, yeah i have looked at that. I know how it is supposed to work, but its the reursive bit that is bothering me, i can recursively partition regions in one direction (eg, i can recursively partition the top left region of the image - and then the top left of that region - and the top left of that etc) . But the problem is trying to break down each region in all directions.
Hi im kind of new too this, but im using the quadtree data structure for a project that i am working on. I am using this to recursively partition an image depending on the levels of pixel variance in selected regions. I am encountering problems when trying to partition groups of regions and was wondering if anyone knows much about the quadtree. I have never used it in a program before and cannot find any implementations of help on the net. I would...
Leave a comment: