Hi, Most of the examples I found assume one type of geometry (mostly point) and then build layer and index accordingly.
In my case, the nodes can be points, lines or polygons. My query set range from finding nearest neighbors to finding the polygon which an arbitrary point is located in, etc. Any advice on a good design is appreciated: how many layers and what kind of indexes, etc. Thanks, Cheers, Alireza -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
