バイナリ空間分割
出典: フリー百科事典『ウィキペディア（Wikipedia）』 (2021/09/20 07:57 UTC 版)
参考文献
- Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf (2000年). Computational Geometry (2nd revised edition ed.). Springer-Verlag. ISBN 3-540-65620-0 Section 12: Binary Space Partitions: pp.251–265. Describes a randomized Painter's Algorithm.
- H. Radha, "Efficient Image Representation using Binary Space Partitioning Trees.", Ph.D. Thesis, Columbia University, 1993.
- H. Radha, M. Vetterli, and R. Leoonardi, “Image Compression Using Binary Space Partitioning Trees,” IEEE Transactions on Image Processing, vol. 5, No.12, December 1996, pp. 1610-1624.
- H. Radha, M. Vetterli, and R. Leoonardi, “Fast Piecewise Constant Approximation of Images,” SPIE Visual Communications and Image Processing 1991, vol. 1605, pp. 475-486.
- ^ Binary Space Partition Trees in 3d worlds
- ^ AN INVESTIGATION INTO REAL-TIME 3D POLYGON RENDERING USING BSP TREES. Andrew Steven Winter. April 1999. available online
- ^ H. Fuchs, Z. M. Kedem and B. F. Naylor. “On Visible Surface Generation by A Priori Tree Structures.” ACM Computer Graphics, pp 124–133. July 1980.
- ^ S. Chen and D. Gordon. “Front-to-Back Display of BSP Trees.” IEEE Computer Graphics & Algorithms, pp 79–85. September 1991.
「バイナリ空間分割」の続きの解説一覧
- バイナリ空間分割のページへのリンク
