Computational Geometry (I.)

POJ 1696

Judging the cross product, in judging the angle.

Like a convex hull, but without a convex hull version.

So I thought of a way.

POJ 2074

Handle each obstacle in the middle of the projection on the road, and then scan.

Pay attention to both ends of the situation!

Special thanks for the data in discuss

POJ 1654

Polygon Area

POJ 1410

My practice is to force judgment, line intersection + Special case (segment in the rectangle inside)

Thanks again for the data in discuss

Also, must learn English, see the topic

POJ 1410

A pure computational problem of a divine (jian) singular (dan)

In fact, because it is a square, you can use the horizontal diagonal instead of the entire square

Then the segment is overwritten

In fact, this segment will only be covered to the left or the right point, it is impossible to divide into two pieces,

(again) n, you know, direct violence.

POJ 2653

At first, how to think how can not live, time complexity is too high, n^2 dare not on,

Think of a god (2) singular (B) of the two points,

The result is wrong ....

Then, together, a discuss, sure enough

Violence.

POJ 2318

The positive solution is based on judging the same side of the two-point segment, and then two points

Computational Geometry (I.)