Counting crossings without floats

A point is inside iff a ray from it crosses the boundary an odd number of times. The classic trap: computing the intersection x with double division — precision dies at 1e15 numerators. The integer form compares signs of cross products; no division anywhere. Degenerate edges still need care: define the crossing condition as (yi > py) != (yj > py).