POJ 3449 Geometric Shapes(判断几个不同图形的相交)

最新推荐文章于 2019-07-27 08:22:44 发布

键盘里的青春

最新推荐文章于 2019-07-27 08:22:44 发布

阅读量635

点赞数

分类专栏：计算几何 ACM

本文链接：https://blog.csdn.net/qq_34374664/article/details/70174892

版权

该问题描述了一种判断不同几何形状（如矩形、正方形、三角形等）在平面内是否相交的算法。给定一组形状，需要找出所有相交情况，并按特定格式输出相交信息。

摘要由CSDN通过智能技术生成

Geometric Shapes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 1243		Accepted: 524

Description

While creating a customer logo, ACM uses graphical utilities to draw a picture that can later be cut into special fluorescent materials. To ensure proper processing, the shapes in the picture cannot intersect. However, some logos contain such intersecting shapes. It is necessary to detect them and decide how to change the picture.

Given a set of geometric shapes, you are to determine all of their intersections. Only outlines are considered, if a shape is completely inside another one, it is not counted as an intersection.