Skip to content

Use network partition script in d.a.m. #1

Description

@dkyleward

My email to caliper:

I have a process that iterates (a lot) and performs a SelectByVicinity() operation each time. My understanding is that a 1 mile search space in this function is a straight-line distance. I’d like for that distance to be network distance. In addition, I don’t really want to create an imprecise polygon buffer or network band (like a isochrones band or something).

Instead, I’d like for the program to simply try and travel as far along the network as possible before hitting the distance cap – selecting all links along the way. Of course, the actual way to solve the problem wouldn’t work like that, but it’s a useful way of explaining the final picture.

Is there something like this? The closest I could find is the network bands tool, but that spends a lot of time making smooth bands – which I don’t want/need. I don’t fully understand the “To Value” option of the CreateBuffer() function, but I don’t think that’s the right path, either.

I feel like this is something you guys have to have – maybe even used by the starting point of your isochrones function. Anyway, it would be amazing to make this improvement over my current straight-line approach!

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

Projects

No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions