• Corpus ID: 5849529

Compression of Large 3D Engineering Models using Automatic Discovery of Repeating Geometric Features

  title={Compression of Large 3D Engineering Models using Automatic Discovery of Repeating Geometric Features},
  author={Dinesh Shikhare and Sushil Bhakar and Sudhir P. Mudur},
In this paper, we present a new geometry compression technique particularly suitable for 3D mesh models of engineering class ‐ architectural models, machine plants, factories, etc. We observe that such models have a number of repeating features at various levels of granularity. In most of the widely available models in this class, the geometric description of such features are also repeated. A major distinctive aspect of our compression technique is that repeating geometric features in the… 

Figures from this paper

Discovering structural regularity in 3D geometry

An optimization method for detecting such uniform grids specifically designed to deal with outliers and missing elements is introduced and yields a robust algorithm that successfully discovers complex regular structures amidst clutter, noise, and missing geometry.

Compression of static and dynamic three-dimensional meshes

A new powerful compression techniques to reduce storage requirements and transmission times of static and dynamic 3D models repre s nt d by triangulated mesh and introduce new and efficient animation segmentation that are very useful for different purposes, typically 3D dynamic mesh compress ion.

3D Mesh Compression

This article summarizes the early works of 3D mesh compression algorithms, describes the algorithms, evaluates their performance, and provides synthetic comparisons and outlines the emerging trends for future research.

3D Mesh Compression

This chapter discusses 3D mesh compression technologies that have been developed over the last decade, with the main focus on triangleMesh compression technologies.

39 3 D mesh compression : survey , comparisons and emerging trends

This article describes the early works of 3D mesh compression algorithms, classify and describe the algorithms, evaluate their performance and provide synthetic comparisons, and outlines the emerging trends for future researches.

Automatic Detection of Repetitive Components in 3D Mechanical Engineering Models

A new Voxel-based Shape Descriptor (VSD) is proposed for effective matching, based on which a similarity function is defined, which uses the voxels intersecting with 3D outline of mechanical components as the feature descriptor.

Recent advances in compression of 3D meshes

Recent developments in compression of 3D surface meshes are surveyed and some open questions and directions for future research are listed.

Geometric Shape Abstraction and Simplification

A new method that captures the so-called cambial growth of a tree – the process that causes individual branches to thicken is introduced and the simulation is coupled to a physical cracking model to produce plausible bark structures.

Compression of 3D Triangle Meshes with a Generalized Parallelogram Prediction Scheme Based on Vector Quantization

A novel prediction method is proposed that generalizes the conventional parallelogram prediction method and further reduces the prediction error, and the proposed algorithm consistently achieves a higher encoding quality at the same bit rate.

3D Mesh coding techniques applied to CAD data: a comparative evaluation

Experimental results show the difficulties of general purpose coders to efficiently handle CAD data, which confirms the need of designing CAD-specific coding techniques.



Compressed Progressive Meshes

The CPM (compressed progressive meshes) approach proposed here uses a new technique, which refines the topology of the mesh in batches in batches, which each increase the number of vertices by up to 50 percent, leading to representations of vertex coordinates that are 50 percent more compact than previously reported progressive geometry compression techniques.

Spectral compression of mesh geometry

These spectral methods may be used for compression and progressive transmission of 3D content, and are shown to be vastly superior to existing methods using spatial techniques, if slight loss can be tolerated.

Geometric compression through topological surgery

This article introduces a new compressed representation for complex triangulated models and simple, yet efficient, compression and decompression algorithms, and improves on Michael Deering's pioneering results by exploiting the geometric coherence of several ancestors in the vertex spanning tree.

A geometric approach to 3D object comparison

  • Marcin NovotniR. Klein
  • Computer Science
    Proceedings International Conference on Shape Modeling and Applications
  • 2001
A novel geometric approach to 3D object comparison and analysis is described that is very well-suited for structures with moderate variance, e.g. bones, fruits, etc.

Geometry compression

This paper introduces the concept of Geometry Compression, lowing 3D triangle data to be represented with a factor of 6 to times fewer bits than conventional techniques, with only slight los es in

Real time compression of triangle mesh connectivity

A new compressed representation for the connectivity of a triangle mesh is introduced allowing a possible hardware realization of the decompression algorithm which could significantly increase the rendering speed of pipelined graphics hardware.

Partial surface and volume matching in three dimensions

  • G. BarequetM. Sharir
  • Computer Science
    Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5)
  • 1994
This paper presents a new technique for partial surface and volume matching of images in three dimensions that treats separately the rotation and the translation components of the Euclidean motion that it seeks, and compares favorably with previous techniques.

Face fixer: compressing polygon meshes with properties

A scheme that handles the topology of arbitrary polygon meshes and encodes meshes directly in their polygonal representation and extends to capture face groupings in a natural way to reduce the storage costs for typical polygon models that have group structures and property data.

Matching 3D models with shape distributions

The primary motivation for this approach is to reduce the shape matching problem to the comparison of probability distributions, which is simpler than traditional shape matching methods that require pose registration, feature correspondence or model fitting.

A signal processing approach to fair surface design

A very simple surface signal low-pass filter algorithm that applies to surfaces of arbitrary topology that is a linear time and space complexity algorithm and a very effective fair surface design technique.