vLOD: high-fidelity walkthrough of large virtual environments
暂无分享,去创建一个
Budirijanto Purnomo | Jonathan D. Cohen | David S. Johnson | Shankar Krishnan | Jatin Chhugani | Subodh Kumar | Suresh Venkatasubramanian | David S. Johnson | S. Venkatasubramanian | J. Chhugani | Shankar Krishnan | J. Cohen | Subodh Kumar | Budirijanto Purnomo
[1] David Ellsworth,et al. Application-controlled demand paging for out-of-core visualization , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).
[2] Edith Cohen,et al. Finding interesting associations without support pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[3] Craig Gotsman,et al. Visibility * techniques and applications Optimized occlusion culling using "ve-dimensional subdivision , 1999 .
[4] Jae-Woo Chang,et al. A new cell-based clustering method for large, high-dimensional data in data mining applications , 2002, SAC '02.
[5] Carlos Andújar,et al. Integrating Occlusion Culling and Levels of Detail through Hardly‐Visible Sets , 2000, Comput. Graph. Forum.
[6] D.M. Mount,et al. An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[7] Hugues Hoppe,et al. Optimization of mesh locality for transparent vertex caching , 1999, SIGGRAPH.
[8] Marc Levoy,et al. Light field rendering , 1996, SIGGRAPH.
[9] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[10] Carlo H. Séquin,et al. Management of large amounts of data in interactive building walkthroughs , 1992, I3D '92.
[11] Dinesh Manocha,et al. Simplifying complex environments using incremental textured depth meshes , 2003, ACM Trans. Graph..
[12] Huan Liu,et al. Subspace clustering for high dimensional data: a review , 2004, SKDD.
[13] Daniel Cohen-Or,et al. Ray space factorization for from-region visibility , 2003, ACM Trans. Graph..
[14] Hugues Hoppe,et al. Progressive meshes , 1996, SIGGRAPH.
[15] Mike M. Chow,et al. Optimized geometry compression for real-time rendering , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).
[16] Enrico Puppo,et al. Building and traversing a surface at variable resolution , 1997 .
[17] Gavin S. P. Miller,et al. Hierarchical Z-buffer visibility , 1993, SIGGRAPH.
[18] Seth J. Teller,et al. Computing the antipenumbra of an area light source , 1992, SIGGRAPH.
[19] Beverly Sackler,et al. Ray Space Factorization for From-Region Visibility , 2002 .
[20] Martin Isenburg,et al. Triangle Strip Compression , 2000, Comput. Graph. Forum.
[21] Daniel G. Aliaga. Visualization of complex models using dynamic texture-based simplification , 1996, Proceedings of Seventh Annual IEEE Visualization '96.
[22] Elaine Cohen,et al. Spatialized Normal Cone Hierarchies , 2000 .
[23] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[24] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[25] Dimitrios Gunopulos,et al. Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.
[26] Cláudio T. Silva,et al. Visibility-based prefetching for interactive out-of-core rendering , 2003, IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003..
[27] Jihad El-Sana,et al. Generalized View‐Dependent Simplification , 1999, Comput. Graph. Forum.
[28] Frédo Durand,et al. The 3D Visibility Complex: A New Approach to the Problems of Accurate Visibility , 1996, Rendering Techniques.
[29] Daniel Cohen-Or,et al. Viewspace partitioning of densely occluded scenes , 1998, SCG '98.
[30] Dinesh Manocha,et al. Out-of-core rendering of massive geometric environments , 2002, IEEE Visualization, 2002. VIS 2002..
[31] Seth J. Teller,et al. Partitioning and ordering large radiosity computations , 1994, SIGGRAPH.
[32] Dieter Schmalstieg,et al. Occluder Shadows for Fast Walkthroughs of Urban Environments , 1999, Comput. Graph. Forum.
[33] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[34] James T. Klosowski,et al. iWalk: Interactive Out-Of-Core Rendering of Large Models , 2002 .
[35] Joseph S. B. Mitchell,et al. Fast and effective stripification of polygonal surface models , 1999, SODA '99.
[36] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[37] Franklin C. Crow,et al. Shadow algorithms for computer graphics , 1977, SIGGRAPH.
[38] Eric Maisel,et al. Memory management schemes for radiosity computation in complex environments , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).
[39] Michael Wimmer,et al. Instant Visibility , 2001, Comput. Graph. Forum.
[40] Craig Gotsman,et al. Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes , 2002, Comput. Graph. Forum.
[41] Carlos Ordonez,et al. Clustering binary data streams with K-means , 2003, DMKD '03.
[42] Craig Gotsman,et al. Triangle Mesh Compression , 1998, Graphics Interface.
[43] Jarek Rossignac,et al. Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.
[44] William Schroeder,et al. The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics , 1997 .
[45] François X. Sillion,et al. Conservative volumetric visibility with occluder fusion , 2000, SIGGRAPH.
[46] Edwin H. Blake,et al. Exact From-Region Visibility Culling , 2002, Rendering Techniques.
[47] Seth J. Teller,et al. Real-time occlusion culling for models with large occluders , 1997, SI3D.
[48] Peter Shirley,et al. Visual navigation of large environments using textured clusters , 1995, I3D '95.
[49] A. James Stewart,et al. Effective Compression Techniques for Precomputed Visibility , 1999, Rendering Techniques.
[50] Dinesh Manocha,et al. Hierarchical Back-Face Culling , 1996 .
[51] Joëlle Thollot,et al. Conservative visibility preprocessing using extended projections , 2000, SIGGRAPH.
[52] Raimund Seidel,et al. Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects , 1991, IEEE Trans. Pattern Anal. Mach. Intell..
[53] Michael Deering,et al. Geometry compression , 1995, SIGGRAPH.
[54] Gabriel Taubin,et al. Geometric compression through topological surgery , 1998, TOGS.
[55] Michael Garland,et al. Surface simplification using quadric error metrics , 1997, SIGGRAPH.
[56] A. Guéziec. Surface simplification inside a tolerance volume , 1996 .
[57] James H. Clark,et al. Hierarchical geometric models for visible surface algorithms , 1976, CACM.
[58] Michael Wimmer,et al. Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs , 2000, Rendering Techniques.
[59] Frédo Durand,et al. The visibility skeleton: a powerful and efficient multi-purpose global visibility tool , 1997, SIGGRAPH.
[60] David S. Johnson,et al. Compressing Large Boolean Matrices using Reordering Techniques , 2004, VLDB.
[61] Lihua Zhou,et al. CONNECTIVITY COMPRESSION FOR TRIANGLE MESHES , 2003 .
[62] Jung Hong Chuang. Level of Detail for 3D Graphics , 2002 .
[63] Cláudio T. Silva,et al. Integrating occlusion culling with view-dependent rendering , 2001, Proceedings Visualization, 2001. VIS '01..
[64] Dinesh Manocha,et al. Hierarchical back-face computation , 1996, Comput. Graph..
[65] Daniel G. Aliaga,et al. MMR: an interactive massive model rendering system using geometric and image-based acceleration , 1999, SI3D.
[66] Thomas W. Sederberg,et al. Loop detection in surface patch intersections , 1988, Comput. Aided Geom. Des..
[67] François X. Sillion,et al. Erosion Based Visibility Preprocessing , 2003, Rendering Techniques.
[68] Hujun Bao,et al. Accelerated Walkthroughs of Virtual Environments Based on Visibility Preprocessing and Simplification , 1998, Comput. Graph. Forum.
[69] Leila De Floriani,et al. Building and traversing a surface at variable resolution , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).
[70] Olivier Devillers,et al. Progressive lossless compression of arbitrary simplicial complexes , 2002, SIGGRAPH.
[71] Vincent Kanade,et al. Clustering Algorithms , 2021, Wireless RF Energy Transfer in the Massive IoT Era.
[72] Anselmo Lastra,et al. Interactive display of large-scale NURBS models , 1995, I3D '95.
[73] William V. Baxter,et al. GigaWalk: Interactive Walkthrough of Complex Environments , 2002, Rendering Techniques.
[74] D. Patterson,et al. Physical mapping of chromosome 21. , 1993, Progress in clinical and biological research.
[75] Dinesh Manocha,et al. Visibility culling using hierarchical occlusion maps , 1997, SIGGRAPH.
[76] Dinesh Manocha,et al. Accelerated occlusion culling using shadow frusta , 1997, SCG '97.
[77] Frederick P. Brooks,et al. Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.
[78] Viktor K. Prasanna,et al. An Efficient Algorithm for Out-of-Core Matrix Transposition , 2002, IEEE Trans. Computers.
[79] Carlo H. Séquin,et al. Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.
[80] Craig Gotsman,et al. Optimized compression of triangle mesh geometry using prediction trees , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.
[81] Gabriel Taubin,et al. Efficient compression of non-manifold polygonal meshes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).
[82] Daniel Cohen-Or,et al. Hardware-Accelerated from-Region Visibility Using a Dual Ray Space , 2001, Rendering Techniques.
[83] Hans-Peter Kriegel,et al. Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications , 1998, Data Mining and Knowledge Discovery.
[84] Reuven Bar-Yehuda,et al. Time/space tradeoffs for polygon mesh rendering , 1996, TOGS.
[85] Lee Aaron Newberg,et al. Physical mapping of chromosomes: A combinatorial problem in molecular biology , 1995, SODA '93.
[86] Pierre Alliez,et al. Progressive compression for lossless transmission of triangle meshes , 2001, SIGGRAPH.
[87] Tiow Seng Tan,et al. Preprocessing occlusion for real-time selective refinement , 1999, SI3D.
[88] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[89] Szymon Rusinkiewicz,et al. New techniques for out-of-core visualization of large datasets , 2004 .
[90] Hugues Hoppe,et al. View-dependent refinement of progressive meshes , 1997, SIGGRAPH.
[91] Hans-Peter Kriegel,et al. OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.
[92] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[93] Joseph S. B. Mitchell,et al. Optimal decomposition of polygonal models into triangle strips , 2002, SCG '02.
[94] Andreas Rudolph,et al. Techniques of Cluster Algorithms in Data Mining , 2002, Data Mining and Knowledge Discovery.
[95] Hansong Zhang,et al. Fast backface culling using normal masks , 1997, SI3D.
[96] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[97] Szymon Rusinkiewicz,et al. Visible Zone Maintenance for Real-Time Occlusion Culling , .
[98] Ramesh Hariharan,et al. Derandomizing semidefinite programming based approximation algorithms , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[99] Amitabh Varshney,et al. Dynamic view-dependent simplification for polygonal models , 1996, Proceedings of Seventh Annual IEEE Visualization '96.
[100] Shankar Krishnan,et al. vLOD : A Scalable System for Interactive Walkthroughs of Very Large Virtual Environments , 2003 .
[101] Refael Hassin,et al. Approximation Algorithms for Min-sum p-clustering , 1998, Discret. Appl. Math..
[102] Steven Skiena,et al. Optimizing triangle strips for fast rendering , 1996, Proceedings of Seventh Annual IEEE Visualization '96.
[103] J. Vitter,et al. Approximations with Minimum Packing Constraint Violation , 1992 .
[104] Jarek Rossignac,et al. An Edgebreaker-based efficient compression scheme for regular meshes , 2001, Comput. Geom..
[105] Adrian E. Raftery,et al. How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis , 1998, Comput. J..
[106] William V. Baxter,et al. HLODs for faster display of large static and dynamic environments , 2001, I3D '01.