query: A closed path is made up of 11 line segments. Can one line....
positive_passages.docid: 155993
positive_passages.text: A closed path is made up of 11 line segments. Can one line, not containing a vertex of the path, intersect each of its segments?
negative_passages.docid: 97630
negative_passages.text: A graph which is not a single block has at least two leaf blocks
negative_passages.docid: 140047
negative_passages.text: Average length of the longest segment
negative_passages.docid: 86256
negative_passages.text: Intersection point of line segments
negative_passages.docid: 1283
negative_passages.text: Proper parametrization of a closed curve
negative_passages.docid: 113015
negative_passages.text: Eulerian Paths in a Complete Graph $K_5$
negative_passages.docid: 141471
negative_passages.text: Collapsing a stream of multiple lines into one line
negative_passages.docid: 34766
negative_passages.text: Complete graph with only two possible costs. What's the shortest path's cost from 0 to N - 1
negative_passages.docid: 37503
negative_passages.text: chess path combination
negative_passages.docid: 133633
negative_passages.text: A question about path-connected and arcwise-connected spaces
negative_passages.docid: 16582
negative_passages.text: Show that $n$ lines separate the plane into $\frac{n^2+n+2}{2}$ regions
negative_passages.docid: 72556
negative_passages.text: Is the closure of path-connected set path connected?
negative_passages.docid: 75728
negative_passages.text: From trajectory of GPS points to multiline segment?
negative_passages.docid: 12973
negative_passages.text: finding a path from one point to another with obstacles help
negative_passages.docid: 43416
negative_passages.text: Generating line segments between all points using QGIS
negative_passages.docid: 152442
negative_passages.text: An annulus in $\mathbb R^2$ is path connected
negative_passages.docid: 71997
negative_passages.text: Extruding along a path