Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003541
S. Diamond
Artists and designers are using graphics to indicate relationships within data, to show social and political dynamics between individuals and within groups.This work can be applied to on-line conversations, to mapping geographical spaces, and to create technologies that foster interaction within actual physical spaces (dance for example). What levels of graphic abstraction can humans understand? Is it possible to provide access to different understandings about human relationships if we use graphics as our guide? What are effective uses of 2D and 3D images? I will provide examples of a number of artists' and designers' projects, including my own and several developed at The Banff Centre, that make use of graphics and creativity to interpret and interrupt the flow of data.
{"title":"Mapping conversations: art and understanding","authors":"S. Diamond","doi":"10.1109/SMI.2002.1003541","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003541","url":null,"abstract":"Artists and designers are using graphics to indicate relationships within data, to show social and political dynamics between individuals and within groups.This work can be applied to on-line conversations, to mapping geographical spaces, and to create technologies that foster interaction within actual physical spaces (dance for example). What levels of graphic abstraction can humans understand? Is it possible to provide access to different understandings about human relationships if we use graphics as our guide? What are effective uses of 2D and 3D images? I will provide examples of a number of artists' and designers' projects, including my own and several developed at The Banff Centre, that make use of graphics and creativity to interpret and interrupt the flow of data.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121518368","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}
Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003522
Zheng Xu, K. Kondo
One problem in subdivision surfaces is that the number of meshes grows quickly after every subdivision step, and a surface with a huge number of meshes is difficult to manipulate. In this paper, an adaptive process for carrying out local subdivision with a Doo-Sabin recursive subdivision surface is presented. With this process, we can create Doo-Sabin surfaces that are more densely subdivided in areas of higher curvature or in special areas decided by users. The Doo-Sabin surfaces are constructed using fewer meshes compared to the original Doo-Sabin method.
{"title":"Local subdivision process with Doo-Sabin subdivision surfaces","authors":"Zheng Xu, K. Kondo","doi":"10.1109/SMI.2002.1003522","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003522","url":null,"abstract":"One problem in subdivision surfaces is that the number of meshes grows quickly after every subdivision step, and a surface with a huge number of meshes is difficult to manipulate. In this paper, an adaptive process for carrying out local subdivision with a Doo-Sabin recursive subdivision surface is presented. With this process, we can create Doo-Sabin surfaces that are more densely subdivided in areas of higher curvature or in special areas decided by users. The Doo-Sabin surfaces are constructed using fewer meshes compared to the original Doo-Sabin method.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132600574","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}
Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003540
M. Desbrun
Most meshes are usually produced with both topological and geometrical irregularity (arbitrary valence, non-uniform sampling). This has been seen as a flaw hindering subsequent mesh processing, because most of the other signals we manipulate everyday (sound, image, video) are acquired and processed as regularly sampled data. Three-dimensional (3D) signals, be they surfaces or volumes, are however drastically and inherently different. Although the main body of work on mesh processing has focused on semi-regular meshes (on which the usual DSP tools can be extended quite nicely), we have focused on fully irregular meshes. Understanding this problem of irregularity, inherent to 3D sampling, is fundamental in widely different applications ranging from mesh modeling to smoothing, parameterization, remeshing, and to even compression or animation. We show some of our latest results (both theoretical and practical) and also point to the remaining challenges.
{"title":"Processing irregular meshes","authors":"M. Desbrun","doi":"10.1109/SMI.2002.1003540","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003540","url":null,"abstract":"Most meshes are usually produced with both topological and geometrical irregularity (arbitrary valence, non-uniform sampling). This has been seen as a flaw hindering subsequent mesh processing, because most of the other signals we manipulate everyday (sound, image, video) are acquired and processed as regularly sampled data. Three-dimensional (3D) signals, be they surfaces or volumes, are however drastically and inherently different. Although the main body of work on mesh processing has focused on semi-regular meshes (on which the usual DSP tools can be extended quite nicely), we have focused on fully irregular meshes. Understanding this problem of irregularity, inherent to 3D sampling, is fundamental in widely different applications ranging from mesh modeling to smoothing, parameterization, remeshing, and to even compression or animation. We show some of our latest results (both theoretical and practical) and also point to the remaining challenges.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115441848","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}
Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003529
A. Sheffer
Providing a two-dimensional parameterization of three-dimensional tessellated surfaces is beneficial to many applications in computer graphics, finite-element surface meshing, surface reconstruction and other areas. The applicability of the parameterization depends on how well it preserves the surface metric structures (angles, distances, areas). For a general surface there is no mapping which fully preserves these structures. The distortion usually increases with the rise in surface complexity. For highly complicated surfaces the distortion can become so strong as to make the parameterization unusable for application purposes. One possible solution is to subdivide the surface or introduce seams in a way which will reduce the distortion. This article presents a new method for introduction of seams in three-dimensional tessellated surfaces. The addition of seams reduces the surface complexity and hence reduces the metric distortion produced by the parameterization. Seams often introduce additional constraints on the application for which the parameterization is used, hence their length should be minimal. The new method presented minimizes the seam length while reducing the parameterization distortion.
{"title":"Spanning tree seams for reducing parameterization distortion of triangulated surfaces","authors":"A. Sheffer","doi":"10.1109/SMI.2002.1003529","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003529","url":null,"abstract":"Providing a two-dimensional parameterization of three-dimensional tessellated surfaces is beneficial to many applications in computer graphics, finite-element surface meshing, surface reconstruction and other areas. The applicability of the parameterization depends on how well it preserves the surface metric structures (angles, distances, areas). For a general surface there is no mapping which fully preserves these structures. The distortion usually increases with the rise in surface complexity. For highly complicated surfaces the distortion can become so strong as to make the parameterization unusable for application purposes. One possible solution is to subdivide the surface or introduce seams in a way which will reduce the distortion. This article presents a new method for introduction of seams in three-dimensional tessellated surfaces. The addition of seams reduces the surface complexity and hence reduces the metric distortion produced by the parameterization. Seams often introduce additional constraints on the application for which the parameterization is used, hence their length should be minimal. The new method presented minimizes the seam length while reducing the parameterization distortion.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124110498","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}
Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003554
Hao Zhang, E. Fiume
In this paper, we develop a simple, eigenspace matching algorithm for closed 3D contours. Our algorithm relies on a novel method which normalizes the Fourier descriptors (FDs) of a 3D contour with respect to two of its FD coefficients corresponding to the lowest non-zero frequencies. The remaining matching task only involves vertex shift and rotation about the z-axis. Our approach is inspired by the observation that the traditional Fourier transform of a 1D signal is equivalent to the decomposition of the signal into a linear combination of the eigenvectors of a smoothing operator. It turns out that our FD normalization is equivalent to aligning the limit plane approached by the sequence of progressively smoothed 3D contours with the xy-plane.
{"title":"Shape matching of 3D contours using normalized Fourier descriptors","authors":"Hao Zhang, E. Fiume","doi":"10.1109/SMI.2002.1003554","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003554","url":null,"abstract":"In this paper, we develop a simple, eigenspace matching algorithm for closed 3D contours. Our algorithm relies on a novel method which normalizes the Fourier descriptors (FDs) of a 3D contour with respect to two of its FD coefficients corresponding to the lowest non-zero frequencies. The remaining matching task only involves vertex shift and rotation about the z-axis. Our approach is inspired by the observation that the traditional Fourier transform of a 1D signal is equivalent to the decomposition of the signal into a linear combination of the eigenvectors of a smoothing operator. It turns out that our FD normalization is equivalent to aligning the limit plane approached by the sequence of progressively smoothed 3D contours with the xy-plane.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128241252","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}
Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003526
R. Tobler, S. Maierhofer, A. Wilkie
As a general approach to procedural mesh definition we propose two mechanisms for mesh modification: generalized subdivision and rule based mesh growing. In standard subdivision, a specific subdivision rule is applied to a mesh to get a succession of meshes converging to a limit surface. A generalized approach allows different subdivision rules at each level of the subdivision process. By limiting the variations introduced at each level, convergence can be ensured: however in a number of cases it may be of advantage to exploit the expressivity of different subdivision steps at each level, without imposing any limits. Rule based mesh growing is an extension of L-systems to not only work on symbols, but connected symbols, representing faces in a mesh. This mechanism allows the controlled introduction of more complex geometry in places where it is needed to model fine details. Using both these mechanisms in combination we demonstrate, that a great variety of complex objects can be easily modeled and compactly represented.
{"title":"A multiresolution mesh generation approach for procedural definition of complex geometry","authors":"R. Tobler, S. Maierhofer, A. Wilkie","doi":"10.1109/SMI.2002.1003526","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003526","url":null,"abstract":"As a general approach to procedural mesh definition we propose two mechanisms for mesh modification: generalized subdivision and rule based mesh growing. In standard subdivision, a specific subdivision rule is applied to a mesh to get a succession of meshes converging to a limit surface. A generalized approach allows different subdivision rules at each level of the subdivision process. By limiting the variations introduced at each level, convergence can be ensured: however in a number of cases it may be of advantage to exploit the expressivity of different subdivision steps at each level, without imposing any limits. Rule based mesh growing is an extension of L-systems to not only work on symbols, but connected symbols, representing faces in a mesh. This mechanism allows the controlled introduction of more complex geometry in places where it is needed to model fine details. Using both these mechanisms in combination we demonstrate, that a great variety of complex objects can be easily modeled and compactly represented.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129618507","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}
Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003525
L. Ivrissimtzis, N. Dodgson, M. Sabin
We describe a method for efficient calculation of coefficients for subdivision schemes. We work on the unit sphere and we express the z-coordinate of all the existing points as power series in the variable cos /spl theta/. Any linear combination of them is also a power series in cos /spl theta/ and, by solving a linear system, we determine the linear combination that will give the smoothest interpolation of the sphere at a particular point.
{"title":"Recursive subdivision and hypergeometric functions","authors":"L. Ivrissimtzis, N. Dodgson, M. Sabin","doi":"10.1109/SMI.2002.1003525","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003525","url":null,"abstract":"We describe a method for efficient calculation of coefficients for subdivision schemes. We work on the unit sphere and we express the z-coordinate of all the existing points as power series in the variable cos /spl theta/. Any linear combination of them is also a power series in cos /spl theta/ and, by solving a linear system, we determine the linear combination that will give the smoothest interpolation of the sphere at a particular point.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123418471","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}
Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003552
M. Mortara, G. Patané
Different application fields have shown increasing interest in shape description oriented to recognition and similarity issues. Beyond the application aims, the capability of handling details separating them from building elements, the invariance to a set of geometric transformations, the uniqueness and stability to noise represent fundamental properties of each proposed model. This paper defines an affine-invariant skeletal representation; starting from global features of a 3D shape, located by curvature properties, a Reeb graph is defined using the topological distance as a quotient function. If the mesh has uniformly spaced vertices, this Reeb graph can also be rendered as a geometric skeleton defined by the barycenters of pseudo-geodesic circles sequentially expanded from all the feature points.
{"title":"Affine-invariant skeleton of 3D shapes","authors":"M. Mortara, G. Patané","doi":"10.1109/SMI.2002.1003552","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003552","url":null,"abstract":"Different application fields have shown increasing interest in shape description oriented to recognition and similarity issues. Beyond the application aims, the capability of handling details separating them from building elements, the invariance to a set of geometric transformations, the uniqueness and stability to noise represent fundamental properties of each proposed model. This paper defines an affine-invariant skeletal representation; starting from global features of a 3D shape, located by curvature properties, a Reeb graph is defined using the topological distance as a quotient function. If the mesh has uniformly spaced vertices, this Reeb graph can also be rendered as a geometric skeleton defined by the barycenters of pseudo-geodesic circles sequentially expanded from all the feature points.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133258209","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}
Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003551
C. Grimm
We present a surface modeling technique using manifolds. Our approach uses a single, simple parameterization for all surfaces of a given genus. This differs from previous approaches which build a parameterization based on the elements of a mesh. The simple parameterization is more appropriate for applications that perform complex operations in parameter space or on the mesh surface. We define a manifold and a corresponding embedding function for three genera (plane, sphere, and torus). The manifold can be used simply as a parameterization tool or as a smooth surface approximating the original mesh. We demonstrate how to build a correspondence between the mesh and the manifold, then how to build an embedding that approximates the mesh.
{"title":"Simple manifolds for surface modeling and parameterization","authors":"C. Grimm","doi":"10.1109/SMI.2002.1003551","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003551","url":null,"abstract":"We present a surface modeling technique using manifolds. Our approach uses a single, simple parameterization for all surfaces of a given genus. This differs from previous approaches which build a parameterization based on the elements of a mesh. The simple parameterization is more appropriate for applications that perform complex operations in parameter space or on the mesh surface. We define a manifold and a corresponding embedding function for three genera (plane, sphere, and torus). The manifold can be used simply as a parameterization tool or as a smooth surface approximating the original mesh. We demonstrate how to build a correspondence between the mesh and the manifold, then how to build an embedding that approximates the mesh.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133354374","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}
Pub Date : 2002-05-17DOI: 10.1109/SMI.2002.1003543
J. A. Bærentzen, Niels Jørgen Christensen
In this paper, we propose the use of the level-set method as the underlying technology of a volume sculpting system. The main motivation is that this leads to a very generic technique for deformation of volumetric solids. In addition, our method preserves a distance field volume representation. A scaling window is used to adapt the level-set method to local deformations and to allow the user to control the intensity of the tool. Level-set based tools have been implemented in an interactive sculpting system, and we show sculptures created using the system.
{"title":"Volume sculpting using the level-set method","authors":"J. A. Bærentzen, Niels Jørgen Christensen","doi":"10.1109/SMI.2002.1003543","DOIUrl":"https://doi.org/10.1109/SMI.2002.1003543","url":null,"abstract":"In this paper, we propose the use of the level-set method as the underlying technology of a volume sculpting system. The main motivation is that this leads to a very generic technique for deformation of volumetric solids. In addition, our method preserves a distance field volume representation. A scaling window is used to adapt the level-set method to local deformations and to allow the user to control the intensity of the tool. Level-set based tools have been implemented in an interactive sculpting system, and we show sculptures created using the system.","PeriodicalId":267347,"journal":{"name":"Proceedings SMI. Shape Modeling International 2002","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122506748","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
扫码关注我们
求助内容：
应助结果提醒方式：