Surface Simplification Using multi-edge mesh collapse

Jia, Hui-Xing; Zhang, Yujin

doi:10.1109/icig.2007.91

Cited by 32 publications

(10 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let = are also assigned weight 1. And the weight of other points can be calculated with the equation (8). Once all the points of HBS being assigned with weights, the simplified process samples the points according to their weight.…”

Section: B Identify the Feature Points And Set The Weight Of Pointsmentioning

confidence: 99%

See 1 more Smart Citation

Fast Simplification of Scanned 3D Human Body for Animation

Sun

Zhang

2011

2011 Eighth International Conference Computer Graphics, Imaging and Visualization

View full text Add to dashboard Cite

3D scanned technology has found its increasing application in computer animated movie and game. Due to the over density of scanned data, simplification becomes a crucial process. Many researches have been done in mesh-based (i.e. triangulated faces) simplifications. However, few are focused on preserving the completeness of skeleton semantic. And in sharply simplification case, the losing of skeleton semantic can cause failure of skeleton based animation. Due to those problem and the time consuming of mesh reconstruction, algorithms directly based on point cloud has gained increasingly concentrations. This paper presents a simple and effective algorithm directly based on point cloud which could satisfy the succeed animation requirement when reconstructed from simplification data. It can preserve completeness of the potential skeleton semantic even in sharp decrease of points set without introducing new cracks or holes to the model when reconstructed.

show abstract

Section: B Identify the Feature Points And Set The Weight Of Pointsmentioning

confidence: 99%

“…According to the presentation form of the operated 3D object, the simplification algorithms are cataloged into two types: one is mesh-based simplification [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20] and the other is points cloud based simplification [21][22][23].…”

Section: Related Workmentioning

confidence: 99%

Fast Simplification of Scanned 3D Human Body for Animation

Sun

Zhang

2011

2011 Eighth International Conference Computer Graphics, Imaging and Visualization

View full text Add to dashboard Cite

show abstract

“…This function consists in removing the multi-edge mesh and the relative triangles and then connect the adjacent vertices to the new vertex [10].…”

Section: D Data Visualization On the Webmentioning

confidence: 99%

Cave Chamber Data Modeling and 3D Web Visualization

Silvestre¹,

Rodrigues²,

Figueiredo

et al. 2013

2013 17th International Conference on Information Visualisation

View full text Add to dashboard Cite

Underground caves and its specific structures are important for geomorphological studies. In this paper we present tools to identify and map speleothems by surveying cave chambers interiors.The cave chamber was surveyed using Terrestrial Laser Scanning to acquire point clouds with high level of detail for 3D model generation. This data with 45 million points is useful for either reconstruction, geomorphological studies or virtual visits of caves.With this point cloud we generated a 3D-mesh to represent the surface model of the cave chamber, which is important to study its geomorphological features. A topological structure of the 3D-mesh was also implemented to get an efficient algorithm to help identifying stalactites.The possibility to publish 3D data on the Web is of particular interest for the geospatial field. For this reason, it was decided to make the cave model available in the Web by developing a 3D graphical interface where users can navigate and interact with the three-dimensional models of the cave. For this Web3D framework it was used X3D, WebGL and X3DOM. Such solution does not require any additional plug-ins or components.

show abstract

“…This function removed the multiedge mesh together with the associated triangles, and then connected the adjacent vertices to the new vertex (Chen et al, 2007).…”

Section: D Data Visualization On the Webmentioning

confidence: 99%