New answers tagged computational-geometry
2
For each segment extract the two endpoints (remembering which segment they came from), now sort the endpoints by (say) lexicographical ordering. Any two endpoints that are the same are now adjacent. so, scan the sorted list, attache adjacent segments that share endpoints, and then read the cycle by following the resulting list like structure among the ...
0
For a directed tree, it is possible to find an embeeding in a n-dimensional space, where n is the maximum branching factor of the tree. This approach could be also generalized for (rooted) DAGs.
More to come in the forthcoming paper: https://www.researchgate.net/publication/342902961_Hierarchical_Embedding_for_DAG_Reachability_Queries
Top 50 recent answers are included
