- Computer Graphics and Visualization Techniques
- 3D Shape Modeling and Analysis
- Computational Geometry and Mesh Generation
- Advanced Numerical Analysis Techniques
- Digital Image Processing Techniques
- Advanced Vision and Imaging
- Manufacturing Process and Optimization
- Congenital Heart Disease Studies
- 3D Surveying and Cultural Heritage
- 3D Modeling in Geospatial Applications
- Advanced Data Compression Techniques
- Robotics and Sensor-Based Localization
- Advanced Image and Video Retrieval Techniques
- Human Motion and Animation
- Algorithms and Data Compression
- Data Management and Algorithms
- Additive Manufacturing and 3D Printing Technologies
- Robotic Path Planning Algorithms
- Robotic Mechanisms and Dynamics
- Pulmonary Hypertension Research and Treatments
- Cardiovascular and Diving-Related Complications
- Fluid Dynamics and Heat Transfer
- Graph Theory and Algorithms
- Design Education and Practice
- Interactive and Immersive Displays
Georgia Institute of Technology
2014-2023
Nieuwegein Fonds
2011
Atlanta Technical College
2007-2010
Istituto di Matematica Applicata e Tecnologie Informatiche
2003
IBM Research - Austin
1994-1997
IBM (United States)
1991-1996
IBM Research - Thomas J. Watson Research Center
1991-1995
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of three-dimensional triangle meshes. improves upon storage required by previously reported schemes, most which can guarantee only an O(t log(t)) cost graph mesh t triangles. requires at 2t bits any homeomorphic to sphere and supports fully general meshes using additional per handle hole. For large meshes, entropy coding yields less than 1.5 triangle. Edgebreaker's...
The abundance and importance of complex 3-D data bases in major industry segments, the affordability interactive rendering for office consumer use, exploitation Internet to distribute share have intensified need an effective geometric compression technique that would significantly reduce time required transmit models over digital communication channels, amount memory or disk space store models. Because prevalent representation graphics purposes is polyhedral because are general triangulated...
Most systems that support visual interaction with 3D models use shape representations based on triangle meshes. The size of these imposes limits applications for which complex must be accessed remotely. Techniques simplifying and compressing reduce the transmission time. Multiresolution formats provide quick access to a crude model then refine it progressively. Unfortunately, compared best nonprogressive compression methods, previously proposed progressive refinement techniques impose...
Abstract We propose a new algorithm for automatically computing approximations of given polyhedral object at different levels details. The application this is the display very complex scenes. where many objects are seen with range varying detail. Our approach similar to region‐merging method used image segmentation. iteratively collapse edges, based on measure geometric deviation from initial shape. When edges merged in right order, strategy produces continuum valid original object, which...
The virtual-reality modeling language (VRML) is rapidly becoming the standard file format for transmitting three-dimensional (3-D) virtual worlds across Internet. Static and dynamic descriptions of 3-D objects, multimedia content, a variety hyperlinks can be represented in VRML files. Both browsers authoring tools creations files are widely available several different platforms. In this paper, we describe topologically assisted geometric compression technology included our proposal...
A survey of the field solid modeling and an assessment its strengths limitations are presented. The covers mathematical foundations, representations, algorithms, applications, user interfaces systems. primary conferences for each these five aspects listed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Abstract We present a simple method for compressing very large and regularly sampled scalar fields. Our is particularlyattractive when the entire data set does not fit in memory sampling rate high relative to thefeature size of field all dimensions. Although we report results sets, proposedapproach may be applied higher The based on new Lorenzo predictor, introducedhere, which estimates value at each sample from values processed neighbors. predictedvalues are exact n‐dimensional an implicit...
Back and Forth Error Compensation Correction (BFECC) was recently developed for interface computation by using the level set method. We show that it can be applied to reduce dissipation diffusion encountered in various advection steps uid simulation such as velocity, smoke density image advections. BFECC implemented easily on top of r st order upwinding or semi-Lagrangian integration equations, while providing second accuracy both space time. When evolution, reduces volume loss signi cantly...
Plumber is a specialized shape classification method for detecting tubular features of 3D objects represented by triangle mesh. The algorithm segments surface into connected components that are either body parts or elongated features, is, handle-like and protrusion-like together with their concave counterparts, i.e. narrow tunnels wells. segmentation can be done at single multi-scale, produces graph which codes how the attached to main parts. Moreover, each feature its skeletal line an...
Back and Forth Error Compensation Correction (BFECC) was recently developed for interface computation using a level set method. We show that BFECC can be applied to reduce dissipation diffusion encountered in variety of advection steps, such as velocity, smoke density, image advections on uniform adaptive grids triangulated surface. implemented trivially small modification the first-order upwind or semi-Lagrangian integration equations. It provides second-order accuracy both space time. When...
Liquid and gas interactions often produce bubbles that stay for a long time without bursting on the surface, making dry foam structure. Such lasting simulated by level set method can suffer from small but steady volume error accumulates to visible amount of change. We propose address this problem using control method. track change each connected region, apply carefully computed divergence compensates undesired changes. To compute divergence, we construct mathematical model change, choose...
Liquid and gas interactions often produce bubbles that stay for a long time without bursting on the surface, making dry foam structure. Such lasting simulated by level set method can suffer from small but steady volume error accumulates to visible amount of change. We propose address this problem using control method. track change each connected region, apply carefully computed divergence compensates undesired changes. To compute divergence, we construct mathematical model change, choose...
Abstract The generation of inbetween frames that interpolate a given set key is major component in the production 2D feature animation. Our objective to considerably reduce cost inbetweening phase by offering an intuitive and effective interactive environment automates when possible while allowing artist guide, complement, or override results. Tight inbetweens, which similar frames, are particularly time‐consuming tedious draw. Therefore, we focus on automating these high‐precision expensive...
A free-form deformation that warps a surface or solid may be specified in terms of one several point-displacement constraints must interpolated by the deformation. The Twister approach introduced here, adds capability to impose an orientation change, adding three rotational constraints, at each displaced point. Furthermore, it solves for space warp simultaneously interpolates two sets such displacement and constraints. With 6 DoF magnetic tracker hand, user grab points on near object drag...
Dynapack exploits space-time coherence to compress the consecutive frames of 3D animations triangle meshes constant connectivity. Instead compressing each frame independently (space-only compression) or trajectory vertex (time-only compression), we predict position v f from three its neighbors in and positions these previous (space-time compression). We introduce here two extrapolating spacetime predictors: ELP extension Lorenzo predictor, developed originally for regularly sampled 4D data...