2003

V. Pascucci, D.E. Laney, R. Frank, G. Scorzelli, L. Linsen, B. Hamann, F. Gygi.
**“Real-Time Monitoring of Large Scientific Simulations,”** In *Proceedings of the 18-th annual ACM Symposium on Applied Computing*, Melbourne, Florida, Note: *UCRL-JC-151094*, pp. 194--198. March, 2003.

V. Pascucci, R. J. Frank.
**“Hierarchical Indexing for Out-of-Core Access to Multi-Resolution Data,”** In *Mathematics and Visualization*, Note: *UCRL-JC-140581*, Edited by G.Farin and B. Hamann and H. Hagen, Springer-Verlag, pp. 225--241. 2003.

DOI: 10.1007/978-3-642-55787-3_14

2002

B. Gregoski, M. Duchaineau, P. Lindstrom, V. Pascucci, K. Joy.
**“Interactive View-Dependent Rendering of Large Isosurfaces,”** In *Proceedings of IEEE Conference on Visualization (VIS-02)*, Boston, MA, Note: *UCRL-JC-146819*, pp. 475--482. October, 2002.

P. Lindstrom, V. Pascucci.
**“Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization,”** In *IEEE Transactions on Visualization and Computer Graphics*, Vol. 8, No. 3, Note: *UCRL-JC-147847*, pp. 239--254. July-September, 2002.

L. Linsen, V. Pascucci, M.A. Duchaineau, B. Hamann, K.I. Joy.
**“Hierarchical Representation of Time-varying Volume Data with 4th-root-of-2 Subdivision and Quadrilinear B-spline Wavelets,”** In *Proceedings of Tenth Pacific Conference on Computer Graphics and Applications*, Beijing, China, Note: *UCRL-JC-151063*, pp. 346--355. 2002.

V. Pascucci, K. Cole-McLaughlin.
**“Efficient Computation of the Topology of Level Sets,”** In *Proceedings of IEEE Conference on Visualization (VIS-02)*, Boston, MA, Note: *UCRL-JC-149277*, pp. 187--194. October, 2002.

V. Pascucci.
**“Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse Of Dimensionality,”** In *Proceedings of Eurographics 2002*, Saabruken, Germany, Note: *UCRL-ID-144257*, pp. 451--460. September, 2002.

V. Pascucci.
**“Slow Growing Volumetric Subdivision for 3D Volumetric Data,”** In *SIGGRAPH 2002 Technical Sketches*, 2002.

2001

C. Guerra, V. Pascucci.
**“Finding Line Segments with Tabu Search,”** In *IEICE Transactions on Information & Systems*, Vol. E84-D, No. 12, pp. 1739-1744. December, 2001.

P. Lindstrom, V. Pascucci.
**“Visualization of Large Terrains Made Easy,”** In *Proceedings of the 12th Annual IEEE Conference on Visualization (VIS-01)*, San Diego, CA, Note: *UCRL-JC-144753*, *IEEE Computer Society*, pp. 363--370, 574. October 21-26, 2001.

V. Pascucci, R.J. Frank.
**“Global Static Indexing for Real-time Exploration of Very Large Regular Grids,”** In *Proceedings of Supercomputing 2001*, Note: *UCRL-JC-144754*, *ACM*, Nov, 2001.

V. Pascucci.
**“On the Topology of the Level Sets of a Scalar Field,”** In *Proceedings of the 13th Canadian Conference on Computational Geometry*, Note: *UCRL-JC-142262*, pp. 141--144. August, 2001.

A. Shamir, V. Pascucci.
**“Temporal and Spatial Level of Details for Dynamic Meshes,”** In *Proceedings of the ACM Symposium on Virtual Reality Software and Technology 2001*, Banff Center, Canada, *ACM*, November, 2001.

2000

B.S. Duerstock, C.L. Bajaj, V. Pascucci, D.R. Schikore, K. Lin, R.B. Borgens.
**“Advances in Three-Dimensional Reconstruction of the Experimental Spinal Cord Injury,”** In *Computerized Medical Imaging and Graphics*, Vol. 24, No. 6, pp. 389--406. 2000.

V. Pascucci, C.L. Bajaj.
**“Time Critical Isosurface Refinement and Smoothing,”** In *Proceedings of the ACM/IEEE Volume Visualization and Graphics Symposium 2000*, Salt lake City, Utah, Note: *UCRL-JC-139628*, pp. 33--42. October, 2000.

A. Shamir, V. Pascucci, C.L. Bajaj.
**“Multi-Resolution Dynamic Meshes with Arbitrary Deformations,”** In *Proceedings of IEEE Conference on Visualization (VIS-00)*, Salt lake City, Utah, Note: *UCRL-JC-139680*, pp. 423--430. 2000.

1999

C.L. Bajaj, C. Baldazzi, S. Cutchin, A. Paoluzzi, V. Pascucci, M. Vicentino.
**“A Programming Approach for Complex Animations,”** In *Computer Aided Design*, Vol. 31, No. 11, pp. 695--710. 1999.

C.L. Bajaj, V. Pascucci, G. Zhuang.
**“Single Resolution Compression of Arbitrary Triangular Meshes with Properties,”** In *Computational Geometry: Theory and Applications*, Vol. 14, No. 1--3, pp. 167--186. 1999.

ISSN: 0925-7721

DOI: 10.1016/S0925-7721(99)00026-7

Triangular meshes are widely used as primary representation of surface models for networked gaming and for complex interactive design in manufacturing. Accurate triangulation of a surface with sharp features (highly varying curvatures, holes) may require an extremely large number of triangles. Fast transmission of such large triangle meshes is critical to many applications that interactively manipulate geometric models in remote networked environments. The need for a succinct representation is therefore not only to reduce static storage requirements, but also to consume less network bandwidth and thus reduce the transmission time.

In this paper we address the problem of defining a space efficient encoding scheme for both lossless and error-bounded lossy compression of triangular meshes that is robust enough to handle directly arbitrary sets of triangles including non-orientable meshes, non-manifold meshes and even non-mesh cases. The compression is achieved by capturing the redundant information in both the topology (connectivity) and geometry with possibly property attributes. Example models and results are also reported.

C.L. Bajaj, V. Pascucci, D.R. Schikore.
**“Data Visualization Techniques,”** Trends in Software, Vol. 6, Ch. 3: Accelerated IsoContouring of Scalar Fields, John Wiley & Sons, pp. 31--47. 1999.

C.L. Bajaj, V. Pascucci, G. Zhuang.
**“Progressive Compression and Transmission of Arbitrary Triangular Meshes,”** In *Proceedings of the 10th Annual IEEE Conference on Visualization (VIS-99)*, San Francisco, CA, pp. 307--316. October 24-29, 1999.