2009 IEEE International Conference on Shape Modeling and Applications最新文献_第2页

Interpolation to C1 boundary conditions by polynomial of degree six 用六次多项式插值到C1边界条件

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170173

Cai-ming Zhang, Feng Li, Dongmei Niu, Xingqiang Yang

引用次数: 0

Approximate shape matching and symmetry detection for 3D shapes with guaranteed error bounds 具有保证误差范围的三维形状近似匹配与对称检测

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170162

Shankar Krishnan, Suresh Venkatasubramanian

引用次数: 0

A framework for the objective evaluation of segmentation algorithms using a ground-truth of human segmented 3D-models 一个框架，用于客观评估分割算法使用的基础真理的人体分割3d模型

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170161

H. Benhabiles, Jean-Philippe Vandeborre, G. Lavoué, M. Daoudi

引用次数: 51

Automatic generation of coarse bounding cages from dense meshes 从密集网格自动生成粗边界笼

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170159

Chuhua Xian, Hongwei Lin, Shuming Gao

引用次数: 37

Contributing vertices-based Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron 无褶非凸多面体与凸多面体的贡献顶点Minkowski和

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170166

H. Barki, Florence Denis, F. Dupont

{"title":"Contributing vertices-based Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron","authors":"H. Barki, Florence Denis, F. Dupont","doi":"10.1109/SMI.2009.5170166","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170166","url":null,"abstract":"We present an original approach for the computation of the Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron, without decomposition and union steps—that constitute the bottleneck of convex decomposition-based algorithms. A non-convex polyhedron without fold is a polyhedron whose boundary is completely recoverable from three orthographic projections defined by three orthogonal basis vectors in ℝ(su3). First, we generate a superset of the Minkowski sum facets using the concept of contributing vertices we accommodate for a non-convex-convex pair of polyhedra. The generated superset guarantees that its envelope is the boundary of the Minkowski sum polyhedron. Secondly, we extract the Minkowski sum facets and handle the intersections among the superset facets by using 3D envelope computation. Our approach is limited to non-convex polyhedra without fold because of the use of 3D envelope computation to recover the Minkowski sum boundary. Models with holes are not handled by our method. The implementation of our algorithm uses exact number types, produces exact results, and is based on CGAL, the Computational Geometry Algorithms Library.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128795916","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}

引用次数: 19

An exact representation of polygonal objects by C1-continuous scalar fields based on binary space partitioning 基于二进制空间划分的c1连续标量场对多边形对象的精确表示

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170174

O. Fryazinov, A. Pasko, V. Adzhiev

引用次数: 3

On the computation of the minimal ellipse enclosing a set of planar curves 关于包围一组平面曲线的最小椭圆的计算

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170147

Dan Albocher, G. Elber

引用次数: 4

Parameterised free-form feature templates 参数化的自由形式特征模板

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170175

J. Pernot, F. Giannini, B. Falcidieno, J. Léon

引用次数: 10

Feature sensitive bas relief generation 特征敏感有浮雕生成

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170176

Jens Kerber, Art Tevs, Alexander G. Belyaev, Rhaleb Zayer, Hans-Peter Seidel

引用次数: 5

Detail-preserving axial deformation using curve pairs 使用曲线对保持轴向变形的细节

2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170164

Wenbing Ge, Gang Xu, K. Hui, Guoping Wang

{"title":"Detail-preserving axial deformation using curve pairs","authors":"Wenbing Ge, Gang Xu, K. Hui, Guoping Wang","doi":"10.1109/SMI.2009.5170164","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170164","url":null,"abstract":"Traditional axial deformation is simple and intuitive for users to modify the shape of objects. However, unexpected twist of the object may be obtained. The use of a curve-pair allows the local coordinate frame to be controlled intuitively. However, some important geometric details may be lost and changed in the deformation process. In this paper, we present a detail-preserving axial deformation algorithm based on Laplacian coordinates. Instead of embedding the absolute coordinates into deformation space in traditional axial deformation, we transform the Laplacian coordinates at each vertex according to the transformation of local frames at the closest points on the axial curve. Then the deformed mesh is reconstructed by solving a linear system that describes the reconstruction of the local details in least squares sense. By associating a complex 3D object to a curve-pair, the object can be stretched, bend, twisted intuitively through manipulating the curve-pair, and can also be edited by means of view-dependent sketching. This method combines the advantages of axial deformation and Laplacian mesh editing. Experimental results are presented to show the effectiveness of the proposed method.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115041596","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}

引用次数: 1