non-oriented graph in which two nodes are linked if and only if the two parts of a common space and represented by these nodes have a non-empty intersection in that space
via Wikidata · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).