query: How to map each point hypercube to a simplex that contains the point and shares all edges with the hypercube?
positive_passages.docid: 152478
positive_passages.text: Is there a homeomorphism between the $n$-dimensional cube to the $n$-dimensional simplex that doesn't create hard corners?
negative_passages.docid: 158202
negative_passages.text: Minimum dimension to hold $N$ points with given distances?
negative_passages.docid: 10874
negative_passages.text: Map points on a square onto a Torus
negative_passages.docid: 89093
negative_passages.text: Converting cluster of Points to Polygons using QGIS
negative_passages.docid: 19009
negative_passages.text: Combining two lists of different dimensions into a list of all combinations of points?
negative_passages.docid: 125231
negative_passages.text: Bipartite graph in NetworkX
negative_passages.docid: 94202
negative_passages.text: Create Polylines from arrays of points
negative_passages.docid: 52342
negative_passages.text: Partition rectangle into finite number of squares
negative_passages.docid: 123985
negative_passages.text: Simplex Random Walk
negative_passages.docid: 126583
negative_passages.text: Coloring points on an n-gon
negative_passages.docid: 32855
negative_passages.text: Converting point sets to polygon boundaries?
negative_passages.docid: 86115
negative_passages.text: Generating uniform points inside an $m$-dimensional ball
negative_passages.docid: 104146
negative_passages.text: How to make a curve path from scratch given a list of (x, y, z) points?
negative_passages.docid: 142861
negative_passages.text: Multipartite graphs which are not planar
negative_passages.docid: 26691
negative_passages.text: Uniformly distributed n-dimensional probability vectors over a simplex
negative_passages.docid: 15651
negative_passages.text: How to add a list of vectors (lists) to a directed graph as an edge weight?
negative_passages.docid: 71990
negative_passages.text: Prove there always exists a partition such that vertices in each part have even degree