Index   |   toolbox > datafun > private > quadtree.m
<<  qtree0 unique1  >>
quadtree
PURPOSE ^
QUADTREE Recursive division of a 2-dimensional set.
SYNOPSIS ^
function [ind,bx,by,Nb,lx,ly] = quadtree(x,y,s,n0)
DESCRIPTION ^
 QUADTREE  Recursive division of a 2-dimensional set.
    [IND,BX,BY,NB,LX,LY] = QUADTREE(X,Y,S,N0)
    Performs recursive tree-like division of a set
    of points with coordinates  X,Y.
    S is binary mask showing which points of a set
    are to be counted. N0 is maximum permissible
    number of "counted" points in the elementary
    block.
    Returns vector IND of the same size as X, Y
    showing which region each point of a set belongs
    to; binary matrices BX, BY where each row shows
    "binary address" of each region.
    Also returns "Adjacency matrix" NB which is 1 if 
    i and j regions are neighbours and 0 otherwise;
    and matrices of limits for each region, LX and LY
    so that  PLOT(LX(:,[1 2 2 1 1])',LY(:,[1 1 2 2 1])')
    plots the boundaries of all regions.
DOWNLOAD M-File ^
2.04 KByte
CROSS-REFERENCE INFORMATION ^
This function calls:
QTREE0 Primitive for QUADTREE.
This function is called by:
MKBLOCKS Auxillary routine for block-processing.


Generated on Sat 09-May-2009 10:36:05 by m2html © 2003, Revision by Ch.Begler 2008
^