Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547977
Ramanathan Muthuganapathy, K. Ramani
This paper presents the summary of all the results of the participants in the event SHREC08 — CAD Model Track
本文介绍了在SHREC08 - CAD模型赛道上所有参与者的成绩总结
{"title":"SHape REtrieval contest 2008: CAD models","authors":"Ramanathan Muthuganapathy, K. Ramani","doi":"10.1109/SMI.2008.4547977","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547977","url":null,"abstract":"This paper presents the summary of all the results of the participants in the event SHREC08 — CAD Model Track","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131810555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547996
F. T. Haar, R. Veltkamp
In this work we compute the similarity of 3D faces using a set of eight contour curves. These contours were selected and matched using our 3D face matching framework. In previous work, we performed extensive research to the selection of distinctive facial curves for 3D face matching. To relate the performance of several of these curves to other face matching methods, we participated the Shape Retrieval Contest (SHREC) of 3D face scans. Within this contest we have used a set of eight C-contours and tested their face retrieval performance using two different distance measures. In an attempt to increase the expression invariance of these curves, we employed our 3D face matching framework to match either 100% of the selected features or the subset of the best 60% of the selected features. Results show that the selected distance measure can have a great influence on the distinctiveness of facial curves. In case of large variations in facia) expressiveness, the subset of the best 60% of the features increases the overall performance. With a recognition rate of 91.1% and a mean average precision of 0.693 our method performs reasonably well compared to other methods.
{"title":"SHREC’08 entry: 3D face recognition using facial contour curves","authors":"F. T. Haar, R. Veltkamp","doi":"10.1109/SMI.2008.4547996","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547996","url":null,"abstract":"In this work we compute the similarity of 3D faces using a set of eight contour curves. These contours were selected and matched using our 3D face matching framework. In previous work, we performed extensive research to the selection of distinctive facial curves for 3D face matching. To relate the performance of several of these curves to other face matching methods, we participated the Shape Retrieval Contest (SHREC) of 3D face scans. Within this contest we have used a set of eight C-contours and tested their face retrieval performance using two different distance measures. In an attempt to increase the expression invariance of these curves, we employed our 3D face matching framework to match either 100% of the selected features or the subset of the best 60% of the selected features. Results show that the selected distance measure can have a great influence on the distinctiveness of facial curves. In case of large variations in facia) expressiveness, the subset of the best 60% of the features increases the overall performance. With a recognition rate of 91.1% and a mean average precision of 0.693 our method performs reasonably well compared to other methods.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133105413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547962
Linge Bai, M. Eyiyurekli, D. Breen
Motivated by the ability of living cells to form into specific shapes and structures, we present a new approach to shape modeling based on self-organizing primitives whose behaviors are derived via genetic programming. The key concept of our approach is that local interactions between the primitives direct them to come together into a macroscopic shape. The interactions of the primitives, called morphogenic primitives (MP), are based on the chemotaxis-driven aggregation behaviors exhibited by actual living cells. Here, cells emit a chemical into their environment. Each cell responds to the stimulus by moving in the direction of the gradient of the cumulative chemical field detected at its surface. MPs, though, do not attempt to completely mimic the behavior of real cells. The chemical fields are explicitly defined as mathematical functions and are not necessarily physically accurate. The explicit mathematical form of the chemical field functions are derived via genetic programming (GP), an evolutionary computing process that evolves a population of functions. A fitness measure, based on the shape that emerges from the chemical-field-driven aggregation, determines which functions will be passed along to later generations. This paper describes the cell interactions of MPs and the GP-based method used to define the chemical field functions needed to produce user- specified shapes from simple aggregating primitives.
{"title":"Self-organizing primitives for automated shape composition","authors":"Linge Bai, M. Eyiyurekli, D. Breen","doi":"10.1109/SMI.2008.4547962","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547962","url":null,"abstract":"Motivated by the ability of living cells to form into specific shapes and structures, we present a new approach to shape modeling based on self-organizing primitives whose behaviors are derived via genetic programming. The key concept of our approach is that local interactions between the primitives direct them to come together into a macroscopic shape. The interactions of the primitives, called morphogenic primitives (MP), are based on the chemotaxis-driven aggregation behaviors exhibited by actual living cells. Here, cells emit a chemical into their environment. Each cell responds to the stimulus by moving in the direction of the gradient of the cumulative chemical field detected at its surface. MPs, though, do not attempt to completely mimic the behavior of real cells. The chemical fields are explicitly defined as mathematical functions and are not necessarily physically accurate. The explicit mathematical form of the chemical field functions are derived via genetic programming (GP), an evolutionary computing process that evolves a population of functions. A fitness measure, based on the shape that emerges from the chemical-field-driven aggregation, determines which functions will be passed along to later generations. This paper describes the cell interactions of MPs and the GP-based method used to define the chemical field functions needed to produce user- specified shapes from simple aggregating primitives.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"49 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114113092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547971
Iurie Chiosa, A. Kolb
In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and variational (Lloyd) algorithms, i.e. the initial number of seeds is not predefined and on each level the obtained clustering configuration is quasi-optimal. The algorithm performs a complete mesh analysis regarding the underlying energy functional. Thus, an optimized multilevel clustering is built. The first benefit of this approach is that it resolves the inherent problems of variational algorithms, for which the result and the convergence is strictly related to the initial number and selection of seeds. On the other hand, the greedy nature of hierarchical approaches, i.e. the non-optimal shape of the clusters in the hierarchy, is solved. We present an optimized implementation based on an incremental data structure. We demonstrate the generic nature of our approach by applying it for the generation of optimized multilevel Centroidal Voronoi Diagrams and planar mesh approximation.
{"title":"Variational Multilevel Mesh Clustering","authors":"Iurie Chiosa, A. Kolb","doi":"10.1109/SMI.2008.4547971","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547971","url":null,"abstract":"In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and variational (Lloyd) algorithms, i.e. the initial number of seeds is not predefined and on each level the obtained clustering configuration is quasi-optimal. The algorithm performs a complete mesh analysis regarding the underlying energy functional. Thus, an optimized multilevel clustering is built. The first benefit of this approach is that it resolves the inherent problems of variational algorithms, for which the result and the convergence is strictly related to the initial number and selection of seeds. On the other hand, the greedy nature of hierarchical approaches, i.e. the non-optimal shape of the clusters in the hierarchy, is solved. We present an optimized implementation based on an incremental data structure. We demonstrate the generic nature of our approach by applying it for the generation of optimized multilevel Centroidal Voronoi Diagrams and planar mesh approximation.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130070308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547967
Thiago Bastos, Waldemar Celes Filho
Adaptively Sampled Distance Fields (ADFs) are volumetric shape representations that support a broad range of applications in the areas of computer graphics, computer vision and physics. ADFs are especially beneficial for representing shapes with features at very diverse scales. In this paper, we propose a strategy to represent and reconstruct ADFs on modern graphics hardware (GPUs). We employ a 3D hashing scheme to store the underlying data structure and try to balance the tradeoff between memory requirements and reconstruction efficiency. To render ADFs on GPU, we use a general-purpose ray-casting technique based on sphere tracing, which guarantees the reconstruction of fine details. We also present a way to overcome the Cl discontinuities inherent to ADFs and efficiently reconstruct smooth surface normals across cell boundaries. The effectiveness of our proposal is demonstrated for isosurface rendering and morphing.
{"title":"GPU-accelerated Adaptively Sampled Distance Fields","authors":"Thiago Bastos, Waldemar Celes Filho","doi":"10.1109/SMI.2008.4547967","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547967","url":null,"abstract":"Adaptively Sampled Distance Fields (ADFs) are volumetric shape representations that support a broad range of applications in the areas of computer graphics, computer vision and physics. ADFs are especially beneficial for representing shapes with features at very diverse scales. In this paper, we propose a strategy to represent and reconstruct ADFs on modern graphics hardware (GPUs). We employ a 3D hashing scheme to store the underlying data structure and try to balance the tradeoff between memory requirements and reconstruction efficiency. To render ADFs on GPU, we use a general-purpose ray-casting technique based on sphere tracing, which guarantees the reconstruction of fine details. We also present a way to overcome the Cl discontinuities inherent to ADFs and efficiently reconstruct smooth surface normals across cell boundaries. The effectiveness of our proposal is demonstrated for isosurface rendering and morphing.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124096164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547957
Hao Wang, C. Scheidegger, Cláudio T. Silva
We address the problem of bandwidth selection in MLS surfaces. While the problem has received relatively little attention in the literature, we show that appropriate selection plays a critical role in the quality of reconstructed surfaces. We formulate the MLS polynomial fitting step as a kernel regression problem for both noiseless and noisy data. Based on this framework, we develop fast algorithms to find optimal bandwidths for a large class of weight functions. We show experimental comparisons of our method, which outperforms heuristically chosen functions and weights previously proposed. We conclude with a discussion of the implications of the Levin's two-step MLS projection for bandwidth selection.
{"title":"Optimal bandwidth selection for MLS surfaces","authors":"Hao Wang, C. Scheidegger, Cláudio T. Silva","doi":"10.1109/SMI.2008.4547957","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547957","url":null,"abstract":"We address the problem of bandwidth selection in MLS surfaces. While the problem has received relatively little attention in the literature, we show that appropriate selection plays a critical role in the quality of reconstructed surfaces. We formulate the MLS polynomial fitting step as a kernel regression problem for both noiseless and noisy data. Based on this framework, we develop fast algorithms to find optimal bandwidths for a large class of weight functions. We show experimental comparisons of our method, which outperforms heuristically chosen functions and weights previously proposed. We conclude with a discussion of the implications of the Levin's two-step MLS projection for bandwidth selection.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130514567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547981
Tony Tung, F. Schmitt
This paper presents an evaluation of the stability of the augmented multiresolution Reeb graph (aMRG) for shape retrieval of 3D watertight models. The method is based on a Reeb graph construction which is a well-known topology based shape descriptor. Using multiresolution property and additive geometrical and topological informations, aMRG has shown its efficiency and robustness to retrieve high quality 3D models. The SHREC - SHape REtrieval Contest 2008 Stability on Watertight Models Track data collection B is composed of 1500 models: 15 classes of 100 models. Each class contains original models and models with noise. We propose to evaluate the robustness of the aMRG with embedded topological features with regards to the following perturbations: Gaussian noise, uneven re-sampling, small protrusions, and topological noise.
{"title":"SHREC’08 entry: Shape retrieval of noisy watertight models using aMRG","authors":"Tony Tung, F. Schmitt","doi":"10.1109/SMI.2008.4547981","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547981","url":null,"abstract":"This paper presents an evaluation of the stability of the augmented multiresolution Reeb graph (aMRG) for shape retrieval of 3D watertight models. The method is based on a Reeb graph construction which is a well-known topology based shape descriptor. Using multiresolution property and additive geometrical and topological informations, aMRG has shown its efficiency and robustness to retrieve high quality 3D models. The SHREC - SHape REtrieval Contest 2008 Stability on Watertight Models Track data collection B is composed of 1500 models: 15 classes of 100 models. Each class contains original models and models with noise. We propose to evaluate the robustness of the aMRG with embedded topological features with regards to the following perturbations: Gaussian noise, uneven re-sampling, small protrusions, and topological noise.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132210965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547968
Joon-Kyung Seong, W. Jeong, E. Cohen
The distribution of geometric features is anisotropic by its nature. Intrinsic properties of surfaces such as normal curvatures, for example, varies with direction. In this paper this characteristic of a shape is used to create a new anisotropic geodesic (AG) distance map on parametric surfaces. We first define local distance (LD) from a point as a function of both the surface point and a unit direction in its tangent plane and then define a total distance as an integral of that local distance. The AG distance between points on the surface is then defined as their minimum total distance. The path between the points that attains the minimum is called the anisotropic geodesic path. This differs from the usual geodesic in ways that enable it to better reveal geometric features. Minimizing total distances to attain AG distance is performed by associating the LD function with the tensor speed function that controls wave propagation of the convex Hamilton-Jacobi (H-J) equation solver. We present two different, but related metrics for the local distance function, a curvature tensor and a difference curvature tensor. Each creates a different AG distance. Some properties of both new AG distance maps are presented, including parametrization invariance. We then demonstrate the effectiveness of the proposed geodesic map as a shape discriminator in several applications, including surface segmentation and partial shape matching.
{"title":"Anisotropic geodesic distance computation for parametric surfaces","authors":"Joon-Kyung Seong, W. Jeong, E. Cohen","doi":"10.1109/SMI.2008.4547968","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547968","url":null,"abstract":"The distribution of geometric features is anisotropic by its nature. Intrinsic properties of surfaces such as normal curvatures, for example, varies with direction. In this paper this characteristic of a shape is used to create a new anisotropic geodesic (AG) distance map on parametric surfaces. We first define local distance (LD) from a point as a function of both the surface point and a unit direction in its tangent plane and then define a total distance as an integral of that local distance. The AG distance between points on the surface is then defined as their minimum total distance. The path between the points that attains the minimum is called the anisotropic geodesic path. This differs from the usual geodesic in ways that enable it to better reveal geometric features. Minimizing total distances to attain AG distance is performed by associating the LD function with the tensor speed function that controls wave propagation of the convex Hamilton-Jacobi (H-J) equation solver. We present two different, but related metrics for the local distance function, a curvature tensor and a difference curvature tensor. Each creates a different AG distance. Some properties of both new AG distance maps are presented, including parametrization invariance. We then demonstrate the effectiveness of the proposed geodesic map as a shape discriminator in several applications, including surface segmentation and partial shape matching.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125567521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547954
D. Eppstein, M. Goodrich, Ethan Kim, Rasmus Tamstorf
We study approximate topological matching of quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two quadrilateral meshes. This study is motivated by applications in graphics that involve shape modeling whose results need to be merged in order to produce a final unified representation of an object. We show that the problem of producing a maximum approximate topological match of two quad meshes in NP-hard. Given this result, which makes an exact solution extremely unlikely, we show that the natural greedy algorithm derived from polynomial-time graph isomorphism can produce poor results, even when it is possible to find matches with only a few non-matching quads. Nevertheless, we provide a "lazy-greedy" algorithm that is guaranteed to find good matches when mis-matching portions of mesh are localized. Finally, we provide empirical evidence that this approach produces good matches between similar quad meshes.
{"title":"Approximate topological matching of quadrilateral meshes","authors":"D. Eppstein, M. Goodrich, Ethan Kim, Rasmus Tamstorf","doi":"10.1109/SMI.2008.4547954","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547954","url":null,"abstract":"We study approximate topological matching of quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two quadrilateral meshes. This study is motivated by applications in graphics that involve shape modeling whose results need to be merged in order to produce a final unified representation of an object. We show that the problem of producing a maximum approximate topological match of two quad meshes in NP-hard. Given this result, which makes an exact solution extremely unlikely, we show that the natural greedy algorithm derived from polynomial-time graph isomorphism can produce poor results, even when it is possible to find matches with only a few non-matching quads. Nevertheless, we provide a \"lazy-greedy\" algorithm that is guaranteed to find good matches when mis-matching portions of mesh are localized. Finally, we provide empirical evidence that this approach produces good matches between similar quad meshes.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123464707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547969
M. Chaouch, Anne Verroust-Blondet
In this paper we present a new method for alignment of 3D models. This approach is based on symmetry properties, and uses the fact that the principal components analysis (PCA) have good properties with respect to the planar reflective symmetry. The fast search of the best optimal alignment axes within the PCA-eigenvectors is an essential first step in our alignment process. The plane reflection symmetry is used as a criterion for selection. This pre-processing transforms the alignment problem into an indexing scheme based on the number of the retained PCA-axes. We also introduce a local translational invariance cost (LTIC) that captures a measure of the local translational symmetries of a shape with respect to a given direction. Experimental results show that the proposed method finds the rotation that best aligns a 3D mesh.
{"title":"A novel method for alignment of 3D models","authors":"M. Chaouch, Anne Verroust-Blondet","doi":"10.1109/SMI.2008.4547969","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547969","url":null,"abstract":"In this paper we present a new method for alignment of 3D models. This approach is based on symmetry properties, and uses the fact that the principal components analysis (PCA) have good properties with respect to the planar reflective symmetry. The fast search of the best optimal alignment axes within the PCA-eigenvectors is an essential first step in our alignment process. The plane reflection symmetry is used as a criterion for selection. This pre-processing transforms the alignment problem into an indexing scheme based on the number of the retained PCA-axes. We also introduce a local translational invariance cost (LTIC) that captures a measure of the local translational symmetries of a shape with respect to a given direction. Experimental results show that the proposed method finds the rotation that best aligns a 3D mesh.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129907392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：