{"title":"Direct-Product Volumetric Parameterization of Handlebodies via Harmonic Fields","authors":"Jiazhi Xia, Ying He, Xiaotian Yin, Shuchu Han, X. Gu","doi":"10.1109/SMI.2010.10","DOIUrl":"https://doi.org/10.1109/SMI.2010.10","url":null,"abstract":"Volumetric parameterization plays an important role for geometric modeling. Due to the complicated topological nature of volumes, it is much more challenging than the surface case. This work focuses on the parameterization of volumes with a boundary surface embedded in 3D space. The intuition is to decompose the volume as the direct product of a two dimensional surface and a one dimensional curve. We first partition the boundary surface into ceiling, floor and walls. Then we compute the harmonic field in the volume with a Dirichlet boundary condition. By tracing the integral curve along the gradient of the harmonic function, we can parameterize the volume to the parametric domain. The method is guaranteed to produce bijection for handle bodies with complex topology, including topological balls as a degenerate case. Furthermore, the parameterization is regular everywhere. We apply the proposed parameterization method to construct hexahedral mesh.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"1995 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130406114","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}
Herbert Grasberger, A. Weidlich, A. Wilkie, B. Wyvill
{"title":"Precise Construction and Control of Implicit Fillets in the BlobTree","authors":"Herbert Grasberger, A. Weidlich, A. Wilkie, B. Wyvill","doi":"10.1109/SMI.2010.37","DOIUrl":"https://doi.org/10.1109/SMI.2010.37","url":null,"abstract":"Skeletal implicit modelling systems have been used to design models of both organic and man-made structures, however existing systems lack convenient and accurate methods for users to define fillets when building prototype engineering models. In this work we extend the methodology and skeletal primitives found in the BlobTree and introduce an improved method for modelling fillets. This is done by interpolating between hard-edged and soft-edged representations of a primitive, using the field to control the interpolation. Blending planes are introduced as a way of providing user control for this interpolation. The new methods are expressed as blend operators between two objects and can thus be implemented as a new node in the BlobTree. In addition we introduce an efficient methodology for modelling hard edged primitives.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133178037","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}
{"title":"Surface Deformations Driven by Vector-Valued 1-Forms","authors":"G. Taubin, Çağatay Demiralp","doi":"10.1109/SMI.2010.36","DOIUrl":"https://doi.org/10.1109/SMI.2010.36","url":null,"abstract":"We formulate the problem of surface deformations as the integration in the least square sense of a discrete vector-valued 1-forms obtained as the result of applying smooth stretching and rotation fields to the discrete differential of the 0-form defined by the vertex coordinates of a polygon mesh graph. Simple algorithms result from this formulation, which reduces to the solution of sparse linear systems. The method handles large angle rotations in one step and is invariant to rotations, translations, and scaling. We also introduce the integration of 1-forms along spanning trees as a heuristic to speed up the convergence of iterative solvers.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132688405","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}
{"title":"A New Algorithm for the Computation of the Minkowski Difference of Convex Polyhedra","authors":"H. Barki, Florence Denis, F. Dupont","doi":"10.1109/SMI.2010.12","DOIUrl":"https://doi.org/10.1109/SMI.2010.12","url":null,"abstract":"We present a new algorithm, based on the concept of contributing vertices, for the exact and efficient computation of the Minkowski difference of convex polyhedra. First, we extend the concept of contributing vertices for the Minkowski difference case. Then, we generate a Minkowski difference facets superset by exploiting the information provided by the computed contributing vertices. Finally, we compute the Minkowski difference polyhedron through the trimming of the generated superset. We compared our Contributing Vertices-based Minkowski Difference (CVMD) algorithm to a Nef polyhedra-based approach using Minkowski addition, complement, transposition, and union operations. The performance benchmark shows that our CVMD algorithm outperforms the indirect Nef polyhedra-based approach. All our implementations use exact number types, produce exact results, and are based on CGAL, the Computational Geometry Algorithms Library.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134256851","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}
R. Lou, J. Pernot, P. Véron, F. Giannini, B. Falcidieno, A. Mikchevitch, Raphaël Marc
{"title":"Semantic-Preserving Mesh Direct Drilling","authors":"R. Lou, J. Pernot, P. Véron, F. Giannini, B. Falcidieno, A. Mikchevitch, Raphaël Marc","doi":"10.1109/SMI.2010.11","DOIUrl":"https://doi.org/10.1109/SMI.2010.11","url":null,"abstract":"Advances in modeling of discrete models have allowed the development of approaches for direct mesh modeling and modification. These tools mainly focus on modeling the visual appearance of the shape which is a key criterion for animation or surgical simulation. Most of the time, the resulting mesh quality as well as the semantics preservation capabilities are not considered as key features. These are the limits we overcome in this paper to enable fast and efficient mesh modifications when carrying out numerical simulations of product behaviors using the Finite Element (FE) analysis. In our approach, the modifications involve the resolution of an optimization problem where the constraints come from the shapes of the operating tools and the FE groups (sets of mesh entities) used to support the semantic information (e.g. boundary conditions, materials) contained in the FE mesh model and required for FE simulation. The overall mesh quality, a key point for accurate FE analysis, is guaranteed while minimizing an objective function based on a mechanical model of bar networks which smoothes the repositioning of nodes. Principle of the devised mesh operators is exemplified through the description of a 2D/3D mesh drilling operator. The proposed mesh modification operators are useful in the context of fast maintenance studies and help engineers to assess alternative design solutions aimed at improving the physical behavior of industrial machinery.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124194824","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}
{"title":"The Projective Linear Transition Map for Constructing Smooth Surfaces","authors":"Jörg Peters, Jianhua Fan","doi":"10.1109/SMI.2010.26","DOIUrl":"https://doi.org/10.1109/SMI.2010.26","url":null,"abstract":"We exhibit the essentially unique projective linear (rational linear) reparameterization for constructing C^s surfaces of genus g>0. Conversely, for quadrilaterals and isolated vertices of valence 8, we show constructively for s=1,2 that this map yields a projective linear spline space for surfaces of genus greater or equal to 1. This establishes the reparametrization to be the simplest possible transition map.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115957871","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}
{"title":"Paper-Strip Sculptures","authors":"E. Akleman, Jianer Chen, J. Gross","doi":"10.1109/SMI.2010.14","DOIUrl":"https://doi.org/10.1109/SMI.2010.14","url":null,"abstract":"This paper introduces paper-strip sculptures, a physical mesh data-structure used to represent 2-manifold mesh surfaces for understanding topological and geometrical aspects of shape modeling with visual and tactual examples. With paper strips it is possible to construct simple paper sculptures that can convincingly illustrate a variety of ideas in shape modeling --- such as 2-manifold mesh surfaces, discrete Gaussian curvature, and the Gauss-Bonnet theorem --- with hands-on experiments. Such sculptures can also represent links, knots and weaving. Paper-strip sculptures are also useful to represent and understand non-orientable surfaces such as the projective plane and the Klein bottle.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121600119","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}
Younis Hijazi, D. Bechmann, David Cazier, C. Kern, S. Thery
{"title":"Fully-automatic Branching Reconstruction Algorithm: Application to Vascular Trees","authors":"Younis Hijazi, D. Bechmann, David Cazier, C. Kern, S. Thery","doi":"10.1109/SMI.2010.34","DOIUrl":"https://doi.org/10.1109/SMI.2010.34","url":null,"abstract":"Reconstructing tubular structures with high-order branching is a difficult task to perform automatically. Medical applications in particular demand accurate models of such objects that fulfill specific topological and geometric criteria. Indeed, the reconstructed object should be a 2-manifold surface with compact, adaptive geometry. We present a generic algorithm for automatically reconstructing n-furcated tubular surfaces. Our approach relies on a strong underlying topological structure and a novel n-furcation reconstruction algorithm using convex entities.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126631262","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}
{"title":"3D Feature Line Detection Based on Vertex Labeling and 2D Skeletonization","authors":"D. Kudelski, J. Mari, S. Viseur","doi":"10.1109/SMI.2010.35","DOIUrl":"https://doi.org/10.1109/SMI.2010.35","url":null,"abstract":"In this paper, we present an approach to extract feature lines on a 3D mesh. The main problem of classical methods is the difficulty to obtain connectivity of resulting lines. In order to sort out this recurrent problem, we propose an algorithm based on the following ideas. The first one is to label candidate points: they characterize the relevant areas corresponding to the expected features. Our second idea is to unfold this binary flagged mesh into a 2D space in order to use well-known morphological operators. By mapping the resulting output back on the mesh, we get relevant and connected feature lines. We then apply this technique to geological data scans to extract fractures and bench limits.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121261817","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}
{"title":"Generalized PolyCube Trivariate Splines","authors":"Bo Li, Xin Li, Kexiang Wang, Hong Qin","doi":"10.1109/SMI.2010.40","DOIUrl":"https://doi.org/10.1109/SMI.2010.40","url":null,"abstract":"This paper develops a new trivariate hierarchical spline scheme for volumetric data representation. Unlike conventional spline formulations and techniques, our new framework is built upon a novel parametric domain called Generalized PolyCube (GPC), comprising a set of regular cubes being glued together. Compared with the conventional PolyCube (PC) that could serve as a ``one-piece'' $3$-manifold domain, GPC has more powerful and flexible representation ability. We develop an effective framework that parameterizes a solid model onto a topologically equivalent GPC domain, and design a hierarchical fitting scheme based on trivariate T-splines. The entire data-spline-conversion modeling framework provides high-accuracy data fitting and greatly reduce the number of superfluous control points. It is a powerful toolkit with broader application appeal in shape modeling, engineering analysis, and reverse engineering.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130212222","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}