2003 Shape Modeling International.最新文献

筛选
英文 中文
Capturing the shape of a dynamic world - fast! 捕捉一个动态世界的形状-快!
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199589
M. Magnor, H. Seidel
{"title":"Capturing the shape of a dynamic world - fast!","authors":"M. Magnor, H. Seidel","doi":"10.1109/SMI.2003.1199589","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199589","url":null,"abstract":"Acquiring online the evolving shape of a dynamic scene from a handful of video streams may be considered one of the most challenging, but at the same time also most auspicious tasks in contemporary computer graphics and computer vision research. The anticipation of revolutionary new applications such as interactive 3D television broadcasts motivates the ongoing work on free-viewpoint video rendering. The paper aims at giving a state-of-progress report on this lively research endeavor. Different acquisition setups and online reconstruction approaches are exemplified. Yielding interactive frame rates, depth map-based techniques, polyhedral as well as volumetric visual hull reconstruction approaches, and combined methods employing visual hull-guided depth map estimation are presented. The experience gained with these approaches allows us to identify future research directions towards real-time analysis and high-quality synthesis of dynamic, real-world scenes.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121721411","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}
引用次数: 7
A topological entity matching technique for geometric parametric models 几何参数模型的拓扑实体匹配技术
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199623
Dago Agbodan, D. Marcheix, G. Pierra, Christophe Thabau
{"title":"A topological entity matching technique for geometric parametric models","authors":"Dago Agbodan, D. Marcheix, G. Pierra, Christophe Thabau","doi":"10.1109/SMI.2003.1199623","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199623","url":null,"abstract":"Nowadays, many commercial CAD systems support history-based, constraint-based and feature-based modeling. Unfortunately, most systems fail during the reevaluation phase when various kind of topological changes occur. This issue is known as \"persistent naming\" which refers to the problem of identifying entities in an initial parametric model and matching them in the reevaluated model. We propose a complete framework for identifying and matching any kind of entities based on their underlying topology. The identifying method is based on the invariant structure of each class of form features and on its topological evolution. The matching method compares the initial and the reevaluated topological histories. For each construction step, the matching consists of two phases. In the local phase, two measures of topological similarity are computed between any couple of entities occurring respectively in the reevaluated model and in the initial model. In the global phase, the final matching is defined as a binary relation that maximizes the topological similarity between the matched entities of both models. The naming and matching method has been implemented using the 3D modeling application development platform Open Cascade.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117120176","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}
引用次数: 14
Rough surface modeling using surface growth 使用表面生长的粗糙表面建模
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199599
Yootai Kim, R. Machiraju, D. Thompson
{"title":"Rough surface modeling using surface growth","authors":"Yootai Kim, R. Machiraju, D. Thompson","doi":"10.1109/SMI.2003.1199599","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199599","url":null,"abstract":"In this paper, we present a novel modeling method for synthesizing rough surfaces using discrete surface growth models. We employ a two-pass method. Initial point cluster data is generated using discrete simulation models derived from physical surface growth and evolution. Then, a final surface is reconstructed from the point clusters by a level set method. Since many rough surfaces in nature are formed by deposition and diffusion processes, discrete models simulating these processes can reasonably reproduce natural rough surfaces. These discrete models are easy to implement and efficient enough for interactive control. After generating initial data set from the application of a discrete model, a level set method is used to obtain implicit surface representations. This approach allows us to easily handle complex surface topologies. We demonstrate that our approach allows a flexible and general way to create various rough surfaces.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"423 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115929387","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}
引用次数: 3
Generalized functional and decorative filleting and blending operations 通用功能性和装饰性的圆角和混合操作
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199597
G. Elber
{"title":"Generalized functional and decorative filleting and blending operations","authors":"G. Elber","doi":"10.1109/SMI.2003.1199597","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199597","url":null,"abstract":"The use of blending and filleting operations in solid modeling and computer-aided geometric design is well established. The question of filling a gap between two (or more) surface boundaries or rounding a sharp edge has been extensively investigated. The vast majority of the prior work on blending and filleting concentrated on a wide variety of fitting schemes as well as attempts to establish and guarantee better continuity conditions. This work extends the notion of filleting and blending modeling tools and elevates them into shaping operations that are either functional or ornamental in nature. The extended shaping operations can be conducted between two boundaries of two adjacent surfaces, much like traditional blending or filleting methods. Furthermore, the presented extended forms can also be applied to the interior of a single surface, guided by arbitrary parametric curves in the domain of the patch.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114485802","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}
引用次数: 0
Using growing cell structures for surface reconstruction 利用生长的细胞结构进行表面重建
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199604
I. Ivrissimtzis, W. Jeong, H. Seidel
{"title":"Using growing cell structures for surface reconstruction","authors":"I. Ivrissimtzis, W. Jeong, H. Seidel","doi":"10.1109/SMI.2003.1199604","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199604","url":null,"abstract":"We study the use of neural network algorithms in surface reconstruction from an unorganized point cloud, and meshing of an implicit surface. We found that for such applications, the most suitable type of neural networks is a modified version of the growing cell structure we propose here. The algorithm works by sampling randomly a target space, usually a point cloud or an implicit surface, and adjusting accordingly the neural network. The adjustment includes the connectivity of the network. Doing several experiments we found that the algorithm gives satisfactory results in some challenging situations involving sharp features and concavities. Another attractive feature of the algorithm is that its speed is virtually independent of the size of the input data, making it particularly suitable for the reconstruction of a surface from a very large point set.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115580784","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}
引用次数: 102
A multi-scale approach to 3D scattered data interpolation with compactly supported basis functions 基于紧支持基函数的三维离散数据多尺度插值方法
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199611
Y. Ohtake, A. Belyaev, H. Seidel
{"title":"A multi-scale approach to 3D scattered data interpolation with compactly supported basis functions","authors":"Y. Ohtake, A. Belyaev, H. Seidel","doi":"10.1109/SMI.2003.1199611","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199611","url":null,"abstract":"We propose a hierarchical approach to 3D scattered data interpolation with compactly supported basis functions. Our numerical experiments suggest that the approach integrates the best aspects of scattered data fitting with locally and globally supported basis functions. Employing locally supported functions leads to an efficient computational procedure, while a coarse-to-fine hierarchy makes our method insensitive to the density of scattered data and allows us to restore large parts of missed data. Given a point cloud distributed along a surface, we first use spatial down sampling to construct a coarse-to-fine hierarchy of point sets. Then we interpolate the sets starting from the coarsest level. We interpolate a point set of the hierarchy, as an offsetting of the interpolating function computed at the previous level. An original point set and its coarse-to-fine hierarchy of interpolated sets is presented. According to our numerical experiments, the method is essentially faster than the state-of-the-art scattered data approximation with globally supported RBFs (Carr et al., 2001) and much simpler to implement.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125148271","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}
引用次数: 234
An intermediate level representation scheme for secondary features recognition and B-rep model simplification 一种用于二级特征识别和B-rep模型简化的中级表示方案
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199606
F. Bianconi, P. Stefano
{"title":"An intermediate level representation scheme for secondary features recognition and B-rep model simplification","authors":"F. Bianconi, P. Stefano","doi":"10.1109/SMI.2003.1199606","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199606","url":null,"abstract":"The presence of fillets, rounds, chamfers and grooves is typical of many real-world mechanical components. Such features introduce in the model various topological and geometrical modifications, which may alter the correct understanding of its main features. Another drawback which hinders the correct engineering evaluation of a part is that its geometrical and topological representation is not unique, since it depends either on the different procedures used to generate CAD models or on the different internal representation of the geometric kernels used by CAD packages. The overall aim of this work is to define an intermediate representation scheme, which incorporates information about minor features such as chamfers, fillets, rounds and grooves into a graph based representation and overcomes the problem of non-uniqueness in the geometric representation. The representation scheme discussed here takes as input a solid model in B-rep form, and provides a description of a part at a higher level of abstraction in comparison with the raw B-rep description. A procedure for secondary features recognition is also described in this paper. The proposed algorithm consists of two steps where both topological/geometrical properties and dimensional attributes are investigated in order to fulfill a correct recognition. The recognized secondary features are then inserted into the model as labels, which qualify the relationships between the faces of the graph representation. The resulting modeling scheme can be conveniently used for primary feature recognition as well as for other engineering analysis/simulation purposes.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116027959","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}
引用次数: 12
Classification and solving of merge patterns in geometric constraint solving 几何约束求解中合并模式的分类与求解
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199605
X. Gao, Gui-Fang Zhang
{"title":"Classification and solving of merge patterns in geometric constraint solving","authors":"X. Gao, Gui-Fang Zhang","doi":"10.1109/SMI.2003.1199605","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199605","url":null,"abstract":"A basic idea of geometric constraint solving is to divide a large geometric constraint problem into several subproblems according to certain patterns and then to merge these subproblems to obtain a solution to the original problem. In this paper, we give a classification of the basic merge patterns in 2D when solving a constraint problem with generalized construction sequences. We also obtain the analytical solutions to all eleven cases of merge patterns, which is to assemble two rigid bodies connected with three constraints. We also give conditions to solve these patterns with ruler and compass constructions.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125169225","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}
引用次数: 6
Skeleton extraction of 3D objects with radial basis functions 基于径向基函数的三维物体骨架提取
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199618
Wan-Chun Ma, Fu-Che Wu, M. Ouhyoung
{"title":"Skeleton extraction of 3D objects with radial basis functions","authors":"Wan-Chun Ma, Fu-Che Wu, M. Ouhyoung","doi":"10.1109/SMI.2003.1199618","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199618","url":null,"abstract":"A skeleton is a lower dimensional shape description of an object. The requirements of a skeleton differ with applications. For example, object recognition requires skeletons with primitive shape features to make similarity comparison. On the other hand, surface reconstruction needs skeletons, which contain detailed geometry information to reduce the approximation error in the reconstruction process. Whereas many previous works are concerned about skeleton extraction, most of these methods are sensitive to noise, time consuming, or restricted to specific 3D models. A practical approach for extracting skeletons from general 3D models using radial basis functions (RBFs) is proposed. A skeleton generated with this approach conforms more to the human perception. Given a 3D polygonal model, the vertices are regarded as centers for RBF level set construction. Next, a gradient descent algorithm is applied to each vertex to locate the local maxima in the RBF; the gradient is calculated directly from the partial derivatives of the RBF. Finally, with the inherited connectivity from the original model, local maximum pairs are connected with links driven by the active contour model. The skeletonization process is completed when the potential energy of these links is minimized.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127330407","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}
引用次数: 107
New results in signal processing and compression of polygon meshes 在多边形网格的信号处理和压缩方面取得了新的成果
2003 Shape Modeling International. Pub Date : 2003-05-12 DOI: 10.1109/SMI.2003.1199600
G. Taubin
{"title":"New results in signal processing and compression of polygon meshes","authors":"G. Taubin","doi":"10.1109/SMI.2003.1199600","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199600","url":null,"abstract":"Polygon meshes, 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 3D models of complex virtual environments or assemblies for electronic shopping, collaborative CAD, multi-player video games, and scientific visualization, representations of 3D shapes must be compressed by several orders of magnitude. Furthermore, several closely related methods have been proposed in recent years to smooth, de-noise, edit, compress, transmit, and animate very large polygon meshes, based on topological and combinatorial methods, signal processing techniques, constrained energy minimization, and the solution of diffusion differential equations. This is an overview of some of my recent results in this area: linear anisotropic mesh filtering, bi-level isosurface compression, space-optimized texture maps, and volume warping for adaptive isosurface extraction.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115277757","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}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书