1
vote
Inflate a polyline so that the 2D band can be triangulated without self-intersections
I think your "inflated polyline" can be correctly defined as a union of "inflated line segments". Each such "inflated line segment" will be a rectangle with half-disks on ...
1
vote
Does the even-odd rule ever have false positives for deciding a point in a complex polygon?
The odd-even rule does not require a half-line from the test point, any continuous curve can do (you can deform any area of the plane).
If there is a curve from the point that goes to infinity without ...
1
vote
Does the even-odd rule ever have false positives for deciding a point in a complex polygon?
No, there is no "false positive".
What is the meaning when a rule determines the "insideness"?
The SVG defines the even–odd rule by saying:
This rule determines the "...
1
vote
Finding whether a point lies on the boundary of an geometrical object or not?
Interval
Interval defined as $[l, r]$, test point $v$. Compute $|l-v|$ and $|r-v|$ to find distance from boundary. If the smallest of those distances is less than your tolerance, it's on the boundary.
...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
polygons × 56computational-geometry × 43
algorithms × 32
graphics × 6
graphs × 4
optimization × 4
time-complexity × 2
reference-request × 2
linear-programming × 2
triangulation × 2
data-structures × 1
asymptotics × 1
terminology × 1
search-algorithms × 1
decision-problem × 1
computer-vision × 1
image-processing × 1
matrices × 1
python × 1
enumeration × 1
partitions × 1
balanced-search-trees × 1
clustering × 1
pattern-recognition × 1
intervals × 1