Presents a new interpretation of the binary blending operator of implicit modeling. Instead of considering the operator as a composition of potential functions, we propose to consider it as an implicit curve extruded in an implicit extrusion field. An implicit extrusion field is a 2D space for which each coordinate is a potential field. The study of general concepts around implicit extrusion fields allows us to introduce the theoretical notion of free-form blending, controlled point-by-point by the user. Through the use of functional interpolation functions, we propose modeling tools to create, sculpt or combine implicit primitives by extrusion of a profile in an implicit extrusion field.
{"title":"Implicit extrusion fields: general concepts and some simple applications","authors":"L. Barthe, V. Gaildrat, R. Caubet","doi":"10.1109/SMA.2001.923382","DOIUrl":"https://doi.org/10.1109/SMA.2001.923382","url":null,"abstract":"Presents a new interpretation of the binary blending operator of implicit modeling. Instead of considering the operator as a composition of potential functions, we propose to consider it as an implicit curve extruded in an implicit extrusion field. An implicit extrusion field is a 2D space for which each coordinate is a potential field. The study of general concepts around implicit extrusion fields allows us to introduce the theoretical notion of free-form blending, controlled point-by-point by the user. Through the use of functional interpolation functions, we propose modeling tools to create, sculpt or combine implicit primitives by extrusion of a profile in an implicit extrusion field.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"14 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":"131254161","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}
F. Langbein, B. Mills, A. Marshall, Ralph Robert Martin
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. The quality of such models can be improved in a beautification step, which finds regular geometric patterns approximately present in the model and imposes a maximal consistent subset of constraints deduced from these patterns on the model. This paper presents analysis methods seeking geometric patterns defined by similarities. Their specific types are derived from a part survey estimating the frequencies of the patterns in simple mechanical components. The methods seek clusters of similar objects which describe properties of faces, loops, edges and vertices, try to find special values representing the clusters, and seek approximate symmetries of the model. Experiments show that the patterns detected appear to be suitable for the subsequent beautification steps.
{"title":"Recognizing geometric patterns for beautification of reconstructed solid models","authors":"F. Langbein, B. Mills, A. Marshall, Ralph Robert Martin","doi":"10.1109/SMA.2001.923370","DOIUrl":"https://doi.org/10.1109/SMA.2001.923370","url":null,"abstract":"Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. The quality of such models can be improved in a beautification step, which finds regular geometric patterns approximately present in the model and imposes a maximal consistent subset of constraints deduced from these patterns on the model. This paper presents analysis methods seeking geometric patterns defined by similarities. Their specific types are derived from a part survey estimating the frequencies of the patterns in simple mechanical components. The methods seek clusters of similar objects which describe properties of faces, loops, edges and vertices, try to find special values representing the clusters, and seek approximate symmetries of the model. Experiments show that the patterns detected appear to be suitable for the subsequent beautification steps.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"30 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":"131960948","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}
Introduces a new method of shape modeling using homotopy and object-oriented modeling. Homotopy is a kind of topology that gives more general ideas of presenting invariant properties of geometrical objects and is further expanded to conceptual objects. The conventional shape modeling method, using polygonalization, has serious difficulties in preserving invariant properties, leading to the necessity of a massive amount of data. On the other hand, the combination of homotopy and object-oriented modeling, which uses class hierarchy, helps to preserve invariant properties at all abstraction levels. We explain how our new method helps us to preserve invariant properties, which keeps the amount of data to the minimum possible level, using an example of a tennis ball rolling on a slope.
{"title":"Shape modeling using homotopy","authors":"K. Ohmori, T. Kunii","doi":"10.1109/SMA.2001.923383","DOIUrl":"https://doi.org/10.1109/SMA.2001.923383","url":null,"abstract":"Introduces a new method of shape modeling using homotopy and object-oriented modeling. Homotopy is a kind of topology that gives more general ideas of presenting invariant properties of geometrical objects and is further expanded to conceptual objects. The conventional shape modeling method, using polygonalization, has serious difficulties in preserving invariant properties, leading to the necessity of a massive amount of data. On the other hand, the combination of homotopy and object-oriented modeling, which uses class hierarchy, helps to preserve invariant properties at all abstraction levels. We explain how our new method helps us to preserve invariant properties, which keeps the amount of data to the minimum possible level, using an example of a tennis ball rolling on a slope.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"34 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":"134428915","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}
E. Akleman, Jianer Chen, Fusun Eryoldas, V. Srinivasan
The Doubly Linked Face List (DLFL) structure introduces a powerful modeling paradigm that allows users to alternatively apply topological change operations and subdivision operations on a mesh structure. Moreover the DLFL is topologically robust in the sense that it always guarantees valid 2-manifold surfaces. We further study the relationship between DLFL structure and subdivision algorithms. First, we develop a new corner cutting scheme, which provides a tension parameter to control the shape of the subdivided surface. Second, we develop a careful and efficient algorithm for our corner cutting scheme on the DLFL structure that uses only the basic operations provided by the DLFL structure. This implementation ensures that our new corner cutting scheme preserves topological robustness. The comparative study shows that the corner cutting schemes create better handles and holes than Catmull-Clark (1978) scheme.
{"title":"Handle and hole improvement by using new corner cutting subdivision scheme with tension","authors":"E. Akleman, Jianer Chen, Fusun Eryoldas, V. Srinivasan","doi":"10.1109/SMA.2001.923373","DOIUrl":"https://doi.org/10.1109/SMA.2001.923373","url":null,"abstract":"The Doubly Linked Face List (DLFL) structure introduces a powerful modeling paradigm that allows users to alternatively apply topological change operations and subdivision operations on a mesh structure. Moreover the DLFL is topologically robust in the sense that it always guarantees valid 2-manifold surfaces. We further study the relationship between DLFL structure and subdivision algorithms. First, we develop a new corner cutting scheme, which provides a tension parameter to control the shape of the subdivided surface. Second, we develop a careful and efficient algorithm for our corner cutting scheme on the DLFL structure that uses only the basic operations provided by the DLFL structure. This implementation ensures that our new corner cutting scheme preserves topological robustness. The comparative study shows that the corner cutting schemes create better handles and holes than Catmull-Clark (1978) scheme.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"1 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":"130663840","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}
We present a contribution to the "reverse engineering" process through a method for the extraction of characteristic edges from a digitized parr. The edge determination is realized step by step by locally fitting a surface, which presents a discontinuity. To avoid a long process, this fitting is started only in areas with important curvatures. These areas are automatically detected with a prior paraboloid fitting. This approach enables to split the initial digitized point cloud along the edges. Each "elementary" cloud given by the process is the digitized representation of a basic surface. Such surfaces could be easier to rebuild than the initial global surface, by means of an implicit or parametric representation. Our partition process is a first step to find CAD representation of a digitized part.
{"title":"Partition along characteristic edges of a digitized point cloud","authors":"P. Marin, A. Meyer, Vincent Guigue","doi":"10.1109/SMA.2001.923404","DOIUrl":"https://doi.org/10.1109/SMA.2001.923404","url":null,"abstract":"We present a contribution to the \"reverse engineering\" process through a method for the extraction of characteristic edges from a digitized parr. The edge determination is realized step by step by locally fitting a surface, which presents a discontinuity. To avoid a long process, this fitting is started only in areas with important curvatures. These areas are automatically detected with a prior paraboloid fitting. This approach enables to split the initial digitized point cloud along the edges. Each \"elementary\" cloud given by the process is the digitized representation of a basic surface. Such surfaces could be easier to rebuild than the initial global surface, by means of an implicit or parametric representation. Our partition process is a first step to find CAD representation of a digitized part.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"28 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":"114469457","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}
Kolja Kähler, Christian Rössl, R. Schneider, Jens Vorsatz, H. Seidel
Due to their simplicity triangle meshes are often used to represent geometric surfaces. Their main drawback is the large number of triangles that are required to represent a smooth surface. This problem has been addressed by a large number of mesh simplification algorithms which reduce the number of triangles and approximate the initial mesh. Hierarchical triangle mesh representations provide access to a triangle mesh at a desired resolution, without omitting any information. In this paper we present an infrastructure for mesh decimation, geometric mesh smoothing, and interactive multiresolution editing of arbitrary unstructured triangle meshes. In particular, we demonstrate how mesh reduction and geometric mesh smoothing can be combined to provide a powerful and numerically efficient multiresolution smoothing and editing paradigm.
{"title":"Efficient processing of large 3D meshes","authors":"Kolja Kähler, Christian Rössl, R. Schneider, Jens Vorsatz, H. Seidel","doi":"10.1109/SMA.2001.923394","DOIUrl":"https://doi.org/10.1109/SMA.2001.923394","url":null,"abstract":"Due to their simplicity triangle meshes are often used to represent geometric surfaces. Their main drawback is the large number of triangles that are required to represent a smooth surface. This problem has been addressed by a large number of mesh simplification algorithms which reduce the number of triangles and approximate the initial mesh. Hierarchical triangle mesh representations provide access to a triangle mesh at a desired resolution, without omitting any information. In this paper we present an infrastructure for mesh decimation, geometric mesh smoothing, and interactive multiresolution editing of arbitrary unstructured triangle meshes. In particular, we demonstrate how mesh reduction and geometric mesh smoothing can be combined to provide a powerful and numerically efficient multiresolution smoothing and editing paradigm.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124387897","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：