[1] Pantazopoulos I, Tzafestas S. Occlusion Culling Algorithms:A Comprehensive Survey[J]. Journal of Intelligent & Robotic Systems Theory & Applications. 2002, 35(2):123-156.
[2] Clarisse P. Smart Cities in Japan:An Assessment on the Potential for EU-Japan Cooperation and Business Development[M]. Tokyo:EU-Japan Centre for Industrial Cooperation, 2014
[3] Zhou C, Chen Z, Li M. A parallel method to accelerate spatial operations involving polygon intersections[J]. International Journal of Geographical Information Science. 2018, 32(12):2402-2426.
[4] Zhang F, Zheng Y, Xu D, et al. Real-Time Spatial Queries for Moving Objects Using Storm Topology[J]. ISPRS International Journal of Geo-Information, 2016, 5(10):178.
[5] Li J, Meng L, Wang F Z, et al. A Map-Reduce-enabled SOLAP cube for large-scale remotely sensed data aggregation[J]. Comput. Geosci. 2014, 70(C):110-119.
[6] Hladky J, Seidel H, Steinberger M. The camera offset space:real-time potentially visible set computations for streaming rendering[J]. ACM Trans. Graph. 2019, 38(6):231.
[7] Nutanong S, Tanin E, Rui Z. Visible Nearest Neighbor Queries[C]. 2007.
[8] Sultana N, Hashem T, Kulik L. Group nearest neighbor queries in the presence of obstacles[C]. Dallas, Texas:Association for Computing Machinery, 2014.
[9] Luebke D, Georges C. Simple, Fast Evaluation of Potentially Visible Sets[J]. 2020.
[10] Chakravarty I, Freeman H. Characteristic Views As A Basis For Three-Dimensional Object Recognition[J]. Proceedings of SPIE-The International Society for Optical Engineering. 1982, 336.
[11] O'Rourke J. Finding minimal enclosing boxes[J]. International Journal of Computer & Information Sciences. 1985, 14(3):183-199.
[12] Cohen-Or D, Fibich G, Halperin D, et al. Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes[J]. Comput. Graph. Forum. 1998, 17:243-254
[13] Naylor B, Amanatides J, Thibault W. Merging BSP trees yields polyhedral set operations[J]. SIGGRAPH Comput. Graph. 1990, 24(4):115-124