We are implementing a search of paths where direction of the path is not relevant. The paths can be pretty long (hundreds of miles or more) so when we search for a path proximate to a particular location, we need to look at the start and end points of the paths and only use the more proximate of the two points for sorting/ranking. Any ideas how this can be accomplished?
-- You received this message because you are subscribed to the Google Groups "Thinking Sphinx" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/thinking-sphinx?hl=en.
