发布求助
文献互助 智能选刊 最新文献

2009 IEEE International Conference on Shape Modeling and Applications最新文献

筛选
英文 中文
GridMesh: Fast and high quality 2D Mesh generation for interactive 3D shape modeling GridMesh:快速和高质量的2D网格生成交互式3D形状建模
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170143
Andrew Nealen, Justus Pett, M. Alexa, T. Igarashi
{"title":"GridMesh: Fast and high quality 2D Mesh generation for interactive 3D shape modeling","authors":"Andrew Nealen, Justus Pett, M. Alexa, T. Igarashi","doi":"10.1109/SMI.2009.5170143","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170143","url":null,"abstract":"In this paper we present an algorithm for watertight meshing of closed, sketched curves. The sketch is resampled as a piecewise linear (PWL) curve and placed onto a triangular grid. A small boundary (seed) that describes a closed path along grid points is placed inside the sketch and grown until it resembles the sketch. Vertices of the evolved grid boundary are projected onto the stroke to establish a bijective, ordered mapping. Finally, valences along the boundary are optimized while retaining the previously established mapping. The resulting mesh patch can be duplicated, stitched and inflated to generate a new shape, or used to fill a hole in an existing shape. We have implemented our algorithm in FiberMesh [1], an interactive sketch based interface for designing freeform surfaces, where it is used for the all mesh generation processes. The triangulation generated with our algorithm improves the quality of the model by reducing the number of irregular vertices, while running at real time rates.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"33 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":"130708389","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}
引用次数: 5
Interpolation over arbitrary topology meshes using Doo-Sabin surfaces 使用Doo-Sabin曲面在任意拓扑网格上插值
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170163
Chongyang Deng, Xunnian Yang
{"title":"Interpolation over arbitrary topology meshes using Doo-Sabin surfaces","authors":"Chongyang Deng, Xunnian Yang","doi":"10.1109/SMI.2009.5170163","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170163","url":null,"abstract":"Interpolating an arbitrary topology mesh by a smooth surface plays an important role in geometric modeling and computer graphics. In this paper we present an efficient new algorithm for constructing a Doo-Sabin subdivision surface that interpolates a given mesh. By introducing additional degrees of freedom, the control vertices of the Doo-Sabin subdivision surface can be obtained directly with no need to solve any initial or intermediate large systems. The control points are computed by modifying the geometric rules of the first step of Doo-Sabin subdivision scheme and the resulting surface interpolates given vertices and optionally normal vectors at the vertices. The method has several merits for surface modeling purposes: (1) Efficiency: we obtain a generalized quadratic B-spline surface to interpolate a given mesh in a robust and simple manner. (2) Simplicity: we use only simple geometric rules to construct a smooth surface interpolating given data. (3) Locality: the perturbation of a given vertex only influences the surface shape near this vertex. (4) Freedom: for each vertex, there is one degree of freedom to adjust the shape of the interpolation surface. These features make surface interpolation using Doo-Sabin surface very simple and thus make the method itself suitable for interactive free-form shape design.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"14 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":"133475931","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}
引用次数: 2
Parts-based 2D shape decomposition by convex hull 基于凸包的零件二维形状分解
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170168
L. Wan
{"title":"Parts-based 2D shape decomposition by convex hull","authors":"L. Wan","doi":"10.1109/SMI.2009.5170168","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170168","url":null,"abstract":"Parts-based 2D shape decomposition is important to shape analysis and recognition. Much research in psychology has shown that the human visual system tends to segment complex objects at regions of deep concavities, so concavity measurement is very important to shape decompositions, but it still has not a well accepted definition. In this paper, we propose a method for measuring concavities and segmenting a 2D shape without holes by 2D convex hulls. The primary motivation for using 2D convex hull in our SLA-concavity (straight line and angle concavity) is to grasp global variation trends of the polygon boundary, and furthermore, determine concave vertexes before computing interior angles for representing local attribute. SLA-concavity is invariant despite the presence of arbitrary translations, rotations and scales after normalizing the polygon by its area. For dealing with over-segmentation, we introduce a decomposition method in order of decreasing concavities, avoiding connection of two vertexes in the same pocket generated by a convex hull. Experimental results show that our approach has good performance.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"99 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":"131410720","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}
引用次数: 15
Filling holes in triangular meshes by curve unfolding 用曲线展开法填充三角形网格中的孔洞
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170165
A. Brunton, S. Wuhrer, Chang Shu, P. Bose, E. Demaine
{"title":"Filling holes in triangular meshes by curve unfolding","authors":"A. Brunton, S. Wuhrer, Chang Shu, P. Bose, E. Demaine","doi":"10.1109/SMI.2009.5170165","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170165","url":null,"abstract":"We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled using a minimum energy surface that is obtained in three steps. First, we unfold the hole boundary onto a plane using energy minimization. Second, we triangulate the unfolded hole using a constrained Delaunay triangulation. Third, we embed the triangular mesh as a minimum energy surface in ℝ3. The running time of the method depends primarily on the size of the hole boundary and not on the size of the model, thereby making the method applicable to large models. Our experiments demonstrate the applicability of the algorithm to the problem of filling holes bounded by highly curved boundaries in large models.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"35 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120978544","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}
引用次数: 37
Volumetric texture synthesis of bone micro-structure as a base for scaffold design 骨微结构的体积纹理合成作为支架设计的基础
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170167
Y. Holdstein, A. Fischer, L. Podshivalov, P. Bar-Yoseph
{"title":"Volumetric texture synthesis of bone micro-structure as a base for scaffold design","authors":"Y. Holdstein, A. Fischer, L. Podshivalov, P. Bar-Yoseph","doi":"10.1109/SMI.2009.5170167","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170167","url":null,"abstract":"Bones consist of hierarchical biocomposite materials arranged in multi-scale structural geometry exhibiting complex behavior. This structure is vulnerable to various damaging factors that may cause its degradation, such as accidents, medical operations and diseases. Current technology cannot precisely reconstruct damaged bone tissue and can only roughly approximate such damaged structures. The aim of this research is to develop a method to identify the damaged regions and provide a best fitting scaffold to imitate the original structure, thus offering better rehabilitation.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"9 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":"122258232","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
Distance field transform with an adaptive iteration method 用自适应迭代法进行距离场变换
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170171
Fan Chen, Ye Zhao
{"title":"Distance field transform with an adaptive iteration method","authors":"Fan Chen, Ye Zhao","doi":"10.1109/SMI.2009.5170171","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170171","url":null,"abstract":"We propose a novel distance field transform method based on an iterative method adaptively performed on an evolving active band. Our method utilizes a narrow band to store active grid points being computed. Unlike the conventional fast marching method, we do not maintain a priority queue, and instead, perform iterative computing inside the band. This new algorithm alleviates the programming complexity and the data-structure (e.g. a heap) maintenance overhead, and leads to a parallel amenable computational process. During the active band propagating from a starting boundary layer, each grid point stays in the band for a lifespan time, which is determined by analyzing the particular geometric property of the grid structure. In this way, we find the Face-Centered Cubic (FCC) grid is a good 3D structure for distance transform.We further develop a multiple-segment method for the band propagation, achieving the computational complexity of O(m · N) with a segment-related constant m.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"13 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":"128192745","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}
引用次数: 2
Haptic rendering using C1 continuous reconstructed distance fields 使用C1连续重建距离场的触觉渲染
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170144
Wei Li, Youngung Shon, Sara McMains
{"title":"Haptic rendering using C1 continuous reconstructed distance fields","authors":"Wei Li, Youngung Shon, Sara McMains","doi":"10.1109/SMI.2009.5170144","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170144","url":null,"abstract":"Existing haptic rendering algorithms are limited in the complexity of the models that can be simulated realistically without artifacts such as extraneous force discontinuities or pop-through. High haptic update rates for realistic feedback require fast collision detection methods, such as those achievable using distance fields. We introduce an efficient algorithm for reconstructing a C1 distance field from discretely sampled distances and gradients. Our Coons-patch based interpolation method supports 50 kHz 3-DOF haptic rendering of complex models with high accuracy, while eliminating undesirable force discontinuities and pop-through. The approximation error of our representation on a 256×256×256 grid is similar to that of polygonal model reconstructions containing hundreds of thousands of polygons, an accuracy previously unobtainable with haptic force rendering.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"97 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":"127093264","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
Computing Fenchel-Nielsen coordinates in Teichmuller shape Space 在Teichmuller形状空间中计算fenhel - nielsen坐标
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170148
Miao Jin, W. Zeng, Ning Ding, X. Gu
{"title":"Computing Fenchel-Nielsen coordinates in Teichmuller shape Space","authors":"Miao Jin, W. Zeng, Ning Ding, X. Gu","doi":"10.1109/SMI.2009.5170148","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170148","url":null,"abstract":"Teichmüller shape space is a finite dimensional Riemannian manifold, where each point represents a class of surfaces, which are conformally equivalent, and a path represents a deformation process from one shape to the other. Two surfaces in the real world correspond to the same point in the Teichmüller space, only if they can be conformally mapped to each other. Teichmüller shape space can be used for surface classification purpose in shape modeling.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"186 5 Suppl Nature 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":"123254582","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
On minimal orthographic view covers for polyhedra 多面体的最小正射影盖
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170169
Min Liu, K. Ramani
{"title":"On minimal orthographic view covers for polyhedra","authors":"Min Liu, K. Ramani","doi":"10.1109/SMI.2009.5170169","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170169","url":null,"abstract":"In this paper, we consider the external visibility coverage for polyhedra under the orthographic viewing model. The problem is to compute whether the whole boundary of a polyhedron is visible from a finite set of view directions, and if so, how to compute a minimal set of such view directions. A global visibility map based method is developed to calculate an optimal or near-optimal solution using object space segmentation and viewpoint space sampling. Our method subdivides the concave regions of a polyhedron into a ground set containing two types of segments: concave regions with nonempty global visibility maps and convex polygons in the concave regions whose global visibility maps are empty. The viewpoint space is sampled using a generate-as-required heuristic. The corresponding visibility matrix is computed based on global visibility calculation. Our problem is then modeled as an instance of the classical set-cover problem and solved using a minimal visible set based branch-and-bound algorithm.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"1 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":"128737054","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
An edge matching technique for non-planar face intersections in geometric parametric models 几何参数模型中非平面面交点的边缘匹配技术
2009 IEEE International Conference on Shape Modeling and Applications Pub Date : 2009-06-26 DOI: 10.1109/SMI.2009.5170149
Mehdi Baba-ali, D. Marcheix, Xavier Skapin
{"title":"An edge matching technique for non-planar face intersections in geometric parametric models","authors":"Mehdi Baba-ali, D. Marcheix, Xavier Skapin","doi":"10.1109/SMI.2009.5170149","DOIUrl":"https://doi.org/10.1109/SMI.2009.5170149","url":null,"abstract":"In current feature-based parametric design systems the reusability principle is not as fully supported as it should be. Both unpredictability and ambiguity of models often happen during design modification within one system. This reference deficiency significantly reduces the power of feature-based parametric modeling, where geometry reevaluation generates some unexpected topology, especially when considering edges.We propose in this paper a new edge matching method resulting from the intersection of non-planar faces. This method considers the matching between edges as a geometric transformation which overlays edges of the initial model on edges of the reevaluated model. It finds, among all possible edge mappings, the one which represents the design intent as close as possible. In order to find the right mapping, it quantifies the relevance of each mapping. Moreover, in addition to the edges resulting from the intersection of the same pair of faces, this method uses “virtual edges” for solving some ambiguous cases.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"3 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":"128397412","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
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信