???Visible Surface

In computer graphics rendering it is required to do hidden surface removal, the first step in hidden surface removal is to determine the visible surfaces. In this problem you are asked to write a program to find all visible surfaces from a convex block which consists of many surfaces given an arbitrary view point, where each surface is a polygon and is determined by a number of vertices. For example, in Figure 11 there is a convex block consists of 1010 surfaces and a view point VV . The surfaces 1122, and 33 are visible to the view point V, whose coordinate is (2, 3, 4)(2,3,4), and surfaces 445566778899 and 1010 are invisible to the view point VV.

In this problem, you can assume there is at most 1010 surfaces in each test case.

Figure 1

Input Format

The input contains N+2N+2 line.

Line 11 : N

Line 22 : 11 V_1V1V_2V2\ldotsV_mVm

Line 33 : 22 V_1V1V_2V2\ldotsV_kVk

\ldots

Line N+1N+1 : NN V_1V1V2V2\ldotsV_jVj

Line N+2N+2 : view point

The first line defines the number of surfaces. The second line to the N+1N+1 line are the surfaces with their vertices. The vertex is represented by (x, y, z)(x,y,z).

The last line is the view point which is also in the form of (x, y, z)(x,y,z).

Output Format

The output contains all visible surfaces, sorted by numbers.

Surface 11

Surface 22

Surface kk

样例输入
10
1 5.0 0.707 2.414 0.0 0.707 2.414 0.0 1.707 2.414 5.0 1.707 2.414
2 5.0 1.707 2.414 0.0 1.707 2.414 0.0 2.414 1.707 5.0 2.414 1.707
3 5.0 2.414 1.707 0.0 2.414 1.707 0.0 2.414 0.707 5.0 2.414 0.707
4 5.0 2.414 0.707 0.0 2.414 0.707 0.0 1.707 0.0 5.0 1.707 0.0
5 5.0 1.707 0.0 0.0 1.707 0.0 0.0 0.707 0.0 5.0 0.707 0.0
6 5.0 0.707 0.0 0.0 0.707 0.0 0.0 0.0 0.707 5.0 0.0 0.707
7 5.0 0.0 0.707 0.0 0.0 0.707 0.0 0.0 1.707 5.0 0.0 1.707
8 5.0 0.0 1.707 0.0 0.0 1.707 0.0 0.707 2.414 5.0 0.707 2.414
9 0.0 0.707 2.414 0.0 1.707 2.414 0.0 2.414 1.707 0.0 2.414 0.707 0.0 1.707 0.0 0.0 0.707 0.0 0.0 0.0 0.707 0.0 0.0 1.707
10 5.0 0.707 2.414 5.0 1.707 2.414 5.0 2.414 1.707 5.0 2.414 0.707 5.0 1.707 0.0 5.0 0.707 0.0 5.0 0.0 0.707 5.0 0.0 1.707
2.0 3.0 4.0
样例输出
1
2
3
题目来源

2017 ACM-ICPC 亚洲区(南宁赛区)网络赛

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值