Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Polyhedral models, which are used in most graphics applications, require considerable amounts of storage, even when they only approximate precise shapes with limited accuracy. To support internet access to 30 models of complex virtual environments or assemblies for electronic shopping, collaborative CAD, multi-player video games, scientific visualization, representations of 30 shapes must be compressed by several orders of magnitude. In this talk I will describe the state of the art in schemes for lossy and loss-less compression of triangle and polygonal meshes, including progressive approaches. In additions to single-resolution compression schemes for triangle and polygonal meshes, which result in compressed formats of less than a byte per triangle, multiresolution progressive rejinement approaches have advanced to the point of challenging the best single resolution schemes in compression eficiency. Along with surface simplijication or decimation methods, these approaches, which change the surj5ace topology while approximating the geometry, can be regarded as lossy compression schemes. Finaly, I will describe the status of standardization efforts and open problems.
['Gabriel Taubin']
I am writing a research paper on a idea 3D geometry compression recent advances and challenges
[{"from": "human", "value": "I am writing a research paper on a idea 3D geometry compression recent advances and challenges"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Polyhedral models, which are used in most graphics applications, require considerable amounts of storage, even when they only approximate precise shapes with limited accuracy. To support internet access to 30 models of complex virtual environments or assemblies for electronic shopping, collaborative CAD, multi-player video games, scientific visualization, representations of 30 shapes must be compressed by several orders of magnitude. In this talk I will describe the state of the art in schemes for lossy and loss-less compression of triangle and polygonal meshes, including progressive approaches. In additions to single-resolution compression schemes for triangle and polygonal meshes, which result in compressed formats of less than a byte per triangle, multiresolution progressive rejinement approaches have advanced to the point of challenging the best single resolution schemes in compression eficiency. Along with surface simplijication or decimation methods, these approaches, which change the surj5ace topology while approximating the geometry, can be regarded as lossy compression schemes. Finaly, I will describe the status of standardization efforts and open problems."}]