Proceedings International Conference on Shape Modeling and Applications最新文献

3D compression made simple: Edgebreaker with ZipandWrap on a corner-table 3D压缩变得简单:在角落的桌子上带有ZipandWrap的Edgebreaker

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923399

J. Rossignac

{"title":"3D compression made simple: Edgebreaker with ZipandWrap on a corner-table","authors":"J. Rossignac","doi":"10.1109/SMA.2001.923399","DOIUrl":"https://doi.org/10.1109/SMA.2001.923399","url":null,"abstract":"Edgebreaker is a simple technique for compressing three-dimensional triangle meshes. We introduce here a new formulation of Edgebreaker, which leads to a very simple implementation. We describe it in terms of a simple data structure, which we call the Corner Table. It represents the connectivity of any manifold mesh as two tables, V and O, such that for a corner c, which is the association of a triangle with a vertex, V[c] is an integer reference to the vertex of c and O[c] is an integer reference to the opposite corner. For meshes that are homeomorphic to a sphere, Edgebreaker encodes these two tables with less than 2 bits per triangle. It compresses vertex locations using Touma and Gottsman's parallelogram predictor. We also present a new decompression, inspired by the Wrap&Zip decompression technique developed in collaboration with Andrzej Szymczak. We call it Zip&Wrap, because it works in the inverse direction from Wrap&Zip and zips cracks in the reconstructed mesh sooner. The detailed source code for the compression and the decompression algorithms fits on a single page. A further improvement of the codebook of Edgebreaker, developed with D. King, guarantees no more than 1.73 bits per triangle for the connectivity. Entropy encoding reduces this cost in practice to less than a bit per triangle when the mesh is large. Through minor modifications, the Edgebreaker algorithm has been adapted to manifold meshes with holes and handles, to non-triangle meshes, and to non-manifold meshes. A Corner-Table implementation of these is described elsewhere.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"29 17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122324885","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}

引用次数: 74

Hierarchical D-NURBS surfaces and their physics-based sculpting 分层D-NURBS表面及其基于物理的雕刻

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923397

Meijing Zhang, Hong Qin

{"title":"Hierarchical D-NURBS surfaces and their physics-based sculpting","authors":"Meijing Zhang, Hong Qin","doi":"10.1109/SMA.2001.923397","DOIUrl":"https://doi.org/10.1109/SMA.2001.923397","url":null,"abstract":"In this paper, we present hierarchical D-NURBS as a new shape modeling representation which generalizes powerful, physics-based D-NURBS for interactive geometric design. Our hierarchical D-NURBS can be viewed as a collection of standard D-NURBS finite elements, organized hierarchically in a tree structure and subject to continuity constraints across the shared boundaries of adjacent D-NURBS elements at different levels. The layered and composite construction of hierarchical D-NURBS affords users the effective creation of local features and their flexible, global/local control at different level of details. Within the framework of hierarchical D-NURBS, users can interactively sculpt NURBS geometry more intuitively and conveniently through both global and local toolkits. Based on the data structure of hierarchical D-NURBS, we have developed a prototype software equipped with various physics based toolkits in the form of geometric constraints and simulated forces. Our modeling system allows users to undertake the design tasks of point manipulation, normal editing, curvature control, curve fitting, and area sculpting in interactive graphics and CAD/CAM.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122499940","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}

引用次数: 13

Efficient Lipschitz function evaluation for CSG implicit surfaces CSG隐式曲面的高效Lipschitz函数求值

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923380

Phap Nguyen, H. V. D. Wetering

引用次数: 0

Re-meshing techniques for topological analysis 拓扑分析的重网格技术

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923385

M. Attene, S. Biasotti, M. Spagnuolo

引用次数: 34

Modeling subdivision control meshes for creating cartoon faces 建模细分控制网格创建卡通面孔

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923393

S. Skaria, E. Akleman, F. Parke

引用次数: 11

A parametric solution to common tangents 公切线的参数解

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923395

J. Johnstone

引用次数: 8

Implicit surfaces that interpolate 插值的隐式曲面

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923376

Greg Turk, H. Q. Dinh, J. F. O'Brien, Gary D. Yngve

{"title":"Implicit surfaces that interpolate","authors":"Greg Turk, H. Q. Dinh, J. F. O'Brien, Gary D. Yngve","doi":"10.1109/SMA.2001.923376","DOIUrl":"https://doi.org/10.1109/SMA.2001.923376","url":null,"abstract":"Implicit surfaces are often created by summing a collection of radial basis functions. Researchers have begun to create implicit surfaces that exactly interpolate a given set of points by solving a simple linear system to assign weights to each basis function. Due to their ability to interpolate, these implicit surfaces are more easily controllable than traditional \"blobby\" implicits. There are several additional forms of control over these surfaces that make them attractive for a variety of applications. Surface normals may be directly specified at any location over the surface, and this allows the modeller to pivot the normal while still having the surface pass through the constraints. The degree of smoothness of the surface can be controlled by changing the shape of the basis functions, allowing the surface to be pinched or smooth. On a point-by-point basis the modeller may decide whether a constraint point should be exactly interpolated or approximated. Applications of these implicits include shape transformation, creating surfaces from computer vision data, creation of an implicit surface from a polygonal model, and medical surface reconstruction.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117171918","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}

引用次数: 68

Surface representation using second, fourth and mixed order partial differential equations 用二阶、四阶和混合阶偏微分方程表示曲面

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923396

J. Zhang, L. You

引用次数: 30

A geometric approach to 3D object comparison 三维物体比较的几何方法

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923387

Marcin Novotni, R. Klein

引用次数: 131

Matching 3D models with shape distributions 匹配三维模型与形状分布

Proceedings International Conference on Shape Modeling and Applications Pub Date : 2001-05-07 DOI: 10.1109/SMA.2001.923386

R. Osada, T. Funkhouser, B. Chazelle, D. Dobkin

{"title":"Matching 3D models with shape distributions","authors":"R. Osada, T. Funkhouser, B. Chazelle, D. Dobkin","doi":"10.1109/SMA.2001.923386","DOIUrl":"https://doi.org/10.1109/SMA.2001.923386","url":null,"abstract":"Measuring the similarity between 3D shapes is a fundamental problem, with applications in computer vision, molecular biology, computer graphics, and a variety of other fields. A challenging aspect of this problem is to find a suitable shape signature that can be constructed and compared quickly, while still discriminating between similar and dissimilar shapes. In this paper, we propose and analyze a method for computing shape signatures for arbitrary (possibly degenerate) 3D polygonal models. The key idea is to represent the signature of an object as a shape distribution sampled from a shape function measuring the global geometric properties of an object. 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. We find that the dissimilarities between sampled distributions of simple shape functions (e.g. the distance between two random points on a surface) provide a robust method for discriminating between classes of objects (e.g. cars versus airplanes) in a moderately sized database, despite the presence of arbitrary translations, rotations, scales, reflections, tessellations, simplifications and model degeneracies. They can be evaluated quickly, and thus the proposed method could be applied as a pre-classifier in an object recognition system or in an interactive content-based retrieval application.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117220829","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}

引用次数: 692