
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChiWing Fu, TienTsin Wong, WaiShun Tong, ChiKeung Tang, Andrew J. Hanson, "BinarySpacePartitioned Images for Resolving ImageBased Visibility," IEEE Transactions on Visualization and Computer Graphics, vol. 10, no. 1, pp. 5871, JanuaryFebruary, 2004.  
BibTex  x  
@article{ 10.1109/TVCG.2004.1260758, author = {ChiWing Fu and TienTsin Wong and WaiShun Tong and ChiKeung Tang and Andrew J. Hanson}, title = {BinarySpacePartitioned Images for Resolving ImageBased Visibility}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {10}, number = {1}, issn = {10772626}, year = {2004}, pages = {5871}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2004.1260758}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  BinarySpacePartitioned Images for Resolving ImageBased Visibility IS  1 SN  10772626 SP58 EP71 EPD  5871 A1  ChiWing Fu, A1  TienTsin Wong, A1  WaiShun Tong, A1  ChiKeung Tang, A1  Andrew J. Hanson, PY  2004 KW  Visibility sorting KW  binary space partitioning KW  imagebased rendering KW  segmentation. VL  10 JA  IEEE Transactions on Visualization and Computer Graphics ER   
AbstractWe propose a novel 2D representation for 3D visibility sorting, the
[1] M. Abrash, Inside Quake: VisibleSurface Determination Dr. Dobb's Sourcebook, pp. 4145, Jan./Feb. 1996.
[2] P.K. Agarwal, J. Erickson, and L.J. Guibas, Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles Proc. Ninth Ann. ACMSIAM Symp. Discrete Algorithms, pp. 107116, Jan. 1998.
[3] J.M. Airey, J.H. Rohlf, and F.P. Brooks, Towards Image Realism with Interactive Update Rates in Complex Virtual Building Environments ACM SIGGRAPH Special Issue 1990 Symp. Interactive 3D Graphics, pp. 4150, 1990.
[4] D.P. Anderson, Hidden Line Elimination in Projected Grid Surfaces ACM Trans. Graphics, vol. 1, no. 4, 274288, Oct. 1982.
[5] S. Baker, R. Szeliski, and P. Anadan, A Layered Approach to Stereo Reconstruction Proc. IEEE Computer Vision and Pattern Recognition 1998 (CVPR '98) Conf., 1998.
[6] M. De Berg, M.M. De Groot, and M.H. Overmars, Perfect Binary Space Partitions CGTA: Computational Geometry: Theory and Applications, vol. 7, pp. 8191, Jan. 1997.
[7] W. Bouknight, A Procedure for Generation of ThreeDimensional Halftoned Computer Graphics Presentations, 1970.
[8] W. Bouknight and K. Kelly, An Algorithm for Producing Halftone Computer Graphics Presentations with Shadows and Movable Light Sources, 1970.
[9] T. Cassen, K.R. Subramanian, and Z. Michalewicz, NearOptimal Construction of Partitioning Trees by Evolutionary Techniques Proc. Graphics Interface '95, W.A. Davis and P. Prusinkiewicz, eds., pp. 263271, 1995.
[10] E.E. Catmull, A Subdivision Algorithm for Computer Display of Curved Surfaces PhD thesis, Dept. of Computer Science, Univ. of Utah, 1974.
[11] C.F. Chang, G. Bishop, and A. Lastra, LDI Tree: A Hierarchical Representation for ImageBased Rendering SIGGRAPH '99 Conf. Proc., pp. 291298, Aug. 1999.
[12] H.M. Chen and W.T. Wang, The Feudal Priority Algorithm on HiddenSurface Removal Proc. SIGGRAPH '96, pp. 5564, Aug. 1996.
[13] S.E. Chen and L. Williams, View Interpolation for Image Synthesis Computer Graphics (SIGGRAPH '93 Proc.), vol. 27, pp. 279288, Aug. 1993.
[14] N. Chin and S. Feiner, Near RealTime Shadow Generation Using BSP Trees SIGGRAPH '89 Conf. Proc., vol. 23, pp. 99106, July 1989.
[15] N. Chin and S. Feiner, Fast ObjectPrecision Shadow Generation for Areal Light Sources Using BSP Trees Computer Graphics (1992 Symp. Interactive 3D Graphics), vol. 25, pp. 2130, Mar. 1992.
[16] J.L.D. Comba, Kinetic Vertical Decomposition Trees PhD thesis, Dept. of Computer Science, Stanford Univ., 1999.
[17] G. Crocker, Invisibility Coherence for Faster ScanLine Hidden Surface Algorithms SIGGRAPH '84 Conf. Proc., vol. 18, pp. 95102, July 1984.
[18] P.E. Debevec, C.J. Taylor, and J. Malik, Modeling and Rendering Architecture from Photographs: A Hybrid Geometry and ImageBased Approach SIGGRAPH '96 Conf. Proc., H. Rushmeier, ed., pp. 1120, Aug. 1996.
[19] O. Faugeras and L. Robert, What Can Two Images Tell Us about a Third One? technical report, INRIA, July 1993.
[20] C.W. Fu, T.T. Wong, and P.A. Heng, Computing Visibility for Triangulated Panorama Proc. 10th Eurographics Rendering Workshop, June 1999.
[21] H. Fuchs, G. Abram, and E. Grant, Near RealTime Shade Display of Rigid Objects SIGGRAPH '83 Conf. Proc., vol. 17, pp. 6572, July 1983.
[22] H. Fuchs, Z.M. Kedem, and B.F. Naylor, On Visible Surface Generation by A Priori Tree Structures SIGGRAPH '80 Conf. Proc., vol. 14, pp. 124133, July 1980.
[23] T.A. Funkhouser, C.H. Séquin, and S.J. Teller, Management of Large Amounts of Data in Interactive Building Walkthroughs ACM SIGGRAPH Special Issue 1992 Symp. Interactive 3D Graphics, pp. 1120, 1992.
[24] T.A. Funkhouser and C.H. Séquin, Adaptive Display Algorithm for Interactive Frame Rates during Visualization of Complex Virtual Environments SIGGRAPH '93 Conf. Proc., J.T. Kajiya, ed., vol. 27, pp. 247254, Aug. 1993.
[25] L. Gaucher and G. Medioni, Accurate Motion Flow Estimation with Discontinuities Proc. Seventh Int'l Conf. Computer Vision (ICCV '99), pp. 695702, Sept. 1999.
[26] A.S. Glassner, Space Subdivision for Fast Ray Tracing IEEE Computer Graphics and Applications, vol. 4, no. 10, pp. 1522, Oct. 1984.
[27] S.J. Gortler, R. Grzeszczuk, R. Szeliski, and M.F. Cohen, The Lumigraph Computer Graphics Proc., Ann. Conf. Series, SIGGRAPH '96, pp. 4354, Aug. 1996.
[28] N. Greene, Hierarchical Polygon Tiling with Coverage Masks SIGGRAPH '96 Conf. Proc., pp. 6574, Aug. 1996.
[29] N. Greene and M. Kass, Hierarchical ZBuffer Visibility Computer Graphics Proc., Ann. Conf. Series, pp. 231240, 1993.
[30] J. Jia and C.K. Tang, Texture Synthesis in the Presence of Discontinuities from Noisy Data Proc. Eurographics Rendering Workshop 2002, submitted.
[31] S. Laveau and O. Faugeras, “3D Scene Representation as a Collection of Images,” Proc. 12th Int'l Conf. Pattern Recognition, vol. 1, pp. 689691, 1994.
[32] M.S. Lee and G. Medioni, "Inferring Segmented Surface Description from Stereo Data," Proc. Computer Vision and Pattern Recognition, pp. 346352,Santa Barbara, Calif., June 1998.
[33] J. Lengyel and J. Snyder, Rendering with Coherent Layers Computer Graphics Proc., Ann. Conf. Series, SIGGRAPH '97, pp. 233242, Aug. 1997.
[34] M. Levoy and P. Hanrahan, Light Field Rendering Computer Graphics Proc., Ann. Conf. Series, SIGGRAPH '96, pp. 3142, Aug. 1996.
[35] M. Lhuillier and L. Quan, “Image Interpolation by Joint View Triangulation,” Proc. Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 139145, 1999.
[36] W.R. Mark and G. Bishop, Memory Access Patterns of OcclusionCompatible 3D Image Warping Proc. 1997 Siggraph/Eurographics Workshop Graphics Hardware, pp. 3544, Aug. 1997.
[37] M. McKenna, WorstCase Optimal HiddenSurface Removal ACM Trans. Graphics, vol. 6, no. 1, pp. 1928, Jan. 1987.
[38] L. McMillan and G. Bishop, Plenoptic Modeling: An ImageBased Rendering System Computer Graphics Proc., Ann. Conf. Series, SIGGRAPH '95, pp. 3946, Aug. 1995.
[39] L. McMillan, An ImageBased Approach to ThreeDimensional Computer Graphics PhD thesis, Dept. of Computer Science, Univ. of North Carolina at Chapel Hill, Chapel Hill, 1997.
[40] G. Medioni, M.S. Lee, and C.K. Tang, A Computational Framework for Feature Extraction and Segmentation. Amsterdam: Elseviers Science, 2000.
[41] K. Mulmuley, An Efficient Algorithm for Hidden Surface Removal Computer Graphics (Proc. SIGGRAPH '89), vol. 23, no. 3, pp. 379388, July 1989.
[42] B. Naylor, J. Amanatides, and W. Thibault, Merging BSP Trees Yields Polyhedral Set Operations SIGGRAPH '90 Conf. Proc., vol. 24, pp. 115124, Aug. 1990.
[43] B.F. Naylor, Partitioning Tree Image Representation and Generation from 3D Geometric Models Proc. Graphics Interface '92, pp. 201212, May 1992.
[44] B.F. Naylor, Constructing Good Partitioning Trees Proc. Graphics Interface '93, pp. 181191, May 1993.
[45] M.E. Newell, R.G. Newell, and T.L. Sancha, A Solution to the Hidden Surface Problem Proc. ACM Ann. Conf., vol. I, pp. 443450, 1972.
[46] M.S. Paterson and F.F. Yao, Efficient Binary Space Partitions for HiddenSurface Removal and Solid Modeling Discrete&Computational Geometry, vol. 5, pp. 485503, 1990.
[47] G. Qiu and S. Sudirman, Color Image Coding, Indexing and Retrieval Using Binary Space Partitioning Tree Proc. IEEE Int'l Conf. Image Processing, Oct. 2001.
[48] H.R. Rabiee, R.L. Kashyap, and H. Radha, Multiresolution Image Compression with BSP Trees and MultiLevel Block Truncation Coding Proc. IEEE Second Int'l Conf. Image Processing, pp. 600603, 1995.
[49] H. Radha, M. Vetterli, and R. Leonardi, Image Compression Using Binary Space Partitioning Trees IEEE Trans. Image Processing, vol. 5, no. 12, pp. 16101624, Dec. 1996.
[50] H. Rahda, R. Leonardi, M. Vetterli, and B.F. Naylor, Binary Space Partitioning Tree Representation of Images Visual Comm. and Image Representation, vol. 2, no. 3, pp. 201221, Sept. 1991.
[51] G. Schaufler and M. Priglinger, Efficient Displacement Mapping by Image Warping Proc. 10th Eurographics Workshop Rendering, pp. 175186, 1999.
[52] S. Sechrest and D.P. Greenberg, A Visible Polygon Reconstruction Algorithm ACM Trans. Graphics, vol. 1, no. 1, pp. 2542, Jan. 1982.
[53] J. Shade, S. Gortler, L.W. He, and R. Szeliski, Layered Depth Images SIGGRAPH '98 Conf. Proc., Ann. Conf. Series, July 1998.
[54] J. Snyder and J. Lengyel, Visibility Sorting and Compositing without Splitting for Image Layer Decomposition Proc. SIGGRAPH '98, pp. 219230, July 1998.
[55] K.R. Subramanian and B.F. Naylor, Converting Discrete Images to Partitioning Trees IEEE Trans. Visualization and Computer Graphics, vol. 3, no. 3, pp. 273288, JulySept. 1997.
[56] O. Sudarsky and C. Gotsman, OutputSensitive Visibility Algorithms for Dynamic Scenes with Applications to Virtual Reality Computer Graphics Forum, vol. 15, no. 3, pp. 249258, Aug. 1996.
[57] C.K. Tang, G. Medioni, and M.S. Lee, NDimensional Tensor Voting, and Application to Epipolar Geometry Estimation IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 8, pp. 829844, Aug. 2001.
[58] S. Teller and P. Hanrahan, Global Visibility Algorithms for Illumination Computations Proc. SIGGRAPH '93, pp. 239246, Aug. 1993.
[59] S.J. Teller and C.H. Séquin, Visibility Preprocessing for Interactive Walkthroughs Computer Graphics (Proc. SIGGRAPH '91), T.W. Sederberg, ed., vol. 25, pp. 6169, July 1991.
[60] W.S. Tong and C.K. Tang, First Order Tensor Voting, and Application to 3D Scale Analysis Proc. IEEE CS Conf. Computer Vision and Pattern Recognition 2001 (CVPR '01), Dec. 2001.
[61] E. Torres, Optimization of the Binary Space Partition Algorithm (BSP) for the Visualization of Dynamic Scenes Proc. Eurographics '90, pp. 507518, Sept. 1990.
[62] J.Y.A. Wang and E. Adelson, "Layered Representation for Motion Analysis," Proc. Computer Vision and Pattern Recognition Conf., 1993.
[63] J. Warnock, A HiddenSurface Algorithm for Computer Generated HalfTone Pictures Technical Report TR 415, NTIS AD753 671, Computer Science Dept., Univ. of Utah, 1969.
[64] G.S. Watkins, A RealTime Visible Surface Algorithm Technical Report UTECHCSc70101, Salt Lake City, Utah, 1970.
[65] C. Wylie, G. Romney, D. Evans, and A. Erdahl, HalfTone Perspective Drawings by Computer Proc. AFIPS 1967 FJCC, vol. 31, pp. 4958, 1967.
[66] H. Zhang, D. Manocha, T. Hudson, and K.E. Hoff III, Visibility Culling Using Hierarchical Occlusion Maps Proc. SIGGRAPH '97, pp. 7788, Aug. 1997.