Hi all,
I am looking for a fast algorithm and sup****ting data-structure to
determine
a point is covered by which several overalpped neighboring functions?
To view this problem clearer, suppose on the (x, y) axes there are a
functional array.
The function array consists of many identical or non-identical functions
scattered on the whole (x, y) plane. The layout of the function array
might
be regular(horizontally alligned or vertically alligned) or
irregular(near-random).
Each function can be decribed by a 2D function z=f(x, y) and has a center.
The functions f(x, y) can have infinite or finite sup****ts. But we can
reasonally truncate them into finite regularly-shaped or even symmetrical
sup****t with reasonable accuracy.
Depending on the layout, some of the functions might be overlapping in
some
regions.
Now I want to ask, given a point (x, y), is there a fast algorithm and
sup****ting data-structure to decide which neighboring functions are
overlapping on this point and hence cover this point?
Thank you very much,
-Lucy
|
