query: Finding a ray which intersects a polygon as many times as possible
positive_passages.docid: 144113
positive_passages.text: Finding a ray that intersects a polygon as many times as possible
negative_passages.docid: 94577
negative_passages.text: Filling a polygon with a pattern of insets
negative_passages.docid: 15962
negative_passages.text: Exists a dedicated non-O(n²) Algorithm for avoiding to have overlapping elements?
negative_passages.docid: 116405
negative_passages.text: Recurrence relation for right-angled triangles stuck-together
negative_passages.docid: 147149
negative_passages.text: Intersection of two arcs on sphere
negative_passages.docid: 136563
negative_passages.text: Number of triangles in a regular polygon
negative_passages.docid: 129591
negative_passages.text: Creating a large amount of convex polygons using existing coordinates
negative_passages.docid: 122252
negative_passages.text: How do you determine if a point sits inside a polygon?
negative_passages.docid: 155617
negative_passages.text: Computing geometric intersection (line-on-polygon overlay) using ArcPy?
negative_passages.docid: 137072
negative_passages.text: Number Of Distinct Paths In A Rectangular Grid
negative_passages.docid: 47342
negative_passages.text: Figure out if a fourth point resides within an angle created by three other points
negative_passages.docid: 35083
negative_passages.text: Creating a Grid on a polygon and find number of points in each grid
negative_passages.docid: 27454
negative_passages.text: Calculate the area of an irregular cyclic convex polygon
negative_passages.docid: 72973
negative_passages.text: How do you detect where two line segments intersect?
negative_passages.docid: 42945
negative_passages.text: Find the minimal number of guard points of polygon
negative_passages.docid: 56816
negative_passages.text: Polygon label repeated for each tile
negative_passages.docid: 133067
negative_passages.text: Repeating objects along a path