Listers:
I want to select block points from small
polygons like 1.5 mile radii or 2 minute
drive-time polygons..
I have the block point table which is fine
just large (the .map part is 139 MB)
Trying to select the block points in a polygon
takes a really long time, though.. any
suggestions ?
(I could break the block points out by state
and put a 20-mile buffer around each one
have a first step that determines which state
the polygon is in.. blah blah. but I haven't
given up on the simple way..)
Is there much of a speed difference using
the different spatial operations like Intersect,
Contains, Within ? Will having everything
specified in the same projection going to make
a big difference? (i.e. the block points are in
NAD 83 and polygons may be created
without a defined projection, just lat/lon)
Is there some third-party point-in-polygon
engine that might be faster?
TIA!
Eric Frost
_______________________________________________________________________
List hosting provided by Directions Magazine | www.directionsmag.com |
To unsubscribe, send e-mail to [EMAIL PROTECTED] and
put "unsubscribe MapInfo-L" in the message body.
