ABSTRACT
This chapter focuses on solving the following geometric problems: points, line segments, and plans, calculating the area for union of rectangles by sweep line algorithms, intersection of half-planes and convex hulls and finding the farthest pair of points. In a wireless network with multiple transmitters sending on the same frequencies, it is often a requirement that signals don't overlap, or at least that they don't conflict. Input consists of information for one or more independent transmitter problems. Crossing means that two points of a line segment are respectively on both sides of the straight line containing another line segment, or one point of the line segment is on the straight line. The input lists the vertices of a closed convex polygon in the plane. A square is a four-sided polygon whose sides have equal length and adjacent sides form 90-degree angles.
