To remain an attractive model, skeleton-based implicit surfaces have to allow the design and display of shapes at interactive rates. We focus on surfaces whose skeletons are graphs of interconnected curves. We present subdivision-curve primitives that rely on convolution for generating bulge-free and crease-free implicit surfaces. These surfaces are efficiently yet correctly displayed using local meshes around each curve that locally overlap in blending regions. Subdivision-curve primitives offer a practical solution to the unwanted-blending problem that ensures C/sup 1/ continuity everywhere. Moreover, they can be used to generate representations at different levels of detail, enabling the interactive display of at least a coarse version of the objects, whatever the performance of the workstation.
{"title":"Subdivision-curve primitives: a new solution for interactive implicit modeling","authors":"Marie-Paule Cani, S. Hornus","doi":"10.1109/SMA.2001.923378","DOIUrl":"https://doi.org/10.1109/SMA.2001.923378","url":null,"abstract":"To remain an attractive model, skeleton-based implicit surfaces have to allow the design and display of shapes at interactive rates. We focus on surfaces whose skeletons are graphs of interconnected curves. We present subdivision-curve primitives that rely on convolution for generating bulge-free and crease-free implicit surfaces. These surfaces are efficiently yet correctly displayed using local meshes around each curve that locally overlap in blending regions. Subdivision-curve primitives offer a practical solution to the unwanted-blending problem that ensures C/sup 1/ continuity everywhere. Moreover, they can be used to generate representations at different levels of detail, enabling the interactive display of at least a coarse version of the objects, whatever the performance of the workstation.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"10 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":"127694207","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}
Techniques are presented for moving between adjacent tetrahedra in a tetrahedral mesh. The tetrahedra result from a recursive decomposition of a cube into six initial congruent tetrahedra. A new technique is presented for labeling the triangular faces. The labeling enables the implementation of a binary-like decomposition of each tetrahedron which is represented using a pointerless representation. Outlines of algorithms are given for traversing adjacent triangular faces of equal size in constant time.
{"title":"Constant-time neighbor finding in hierarchical tetrahedral meshes","authors":"M. Lee, H. Samet, L. Floriani","doi":"10.1109/SMA.2001.923400","DOIUrl":"https://doi.org/10.1109/SMA.2001.923400","url":null,"abstract":"Techniques are presented for moving between adjacent tetrahedra in a tetrahedral mesh. The tetrahedra result from a recursive decomposition of a cube into six initial congruent tetrahedra. A new technique is presented for labeling the triangular faces. The labeling enables the implementation of a binary-like decomposition of each tetrahedron which is represented using a pointerless representation. Outlines of algorithms are given for traversing adjacent triangular faces of equal size in constant time.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"70 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":"116244281","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}
J. Claes, Koen Beets, F. Reeth, A. Iones, A. Krupkin
Recursive subdivision schemes have become one of the most important paradigms to model 3D surfaces of arbitrary topology used in computer graphics applications. A number of researchers, both with a mathematical background and from the computer graphics community, have added-and still are adding-different algorithms and features to further improve their capabilities. This paper describes a new modeling tool, providing the possibility to locally choose an interpolating variant of the conventionally approximating Catmull-Clark (1978) subdivision scheme. Our approach combines the advantages of approximating schemes with the precise control of interpolating schemes. Unlike other solutions that mostly narrow down to locally change the weighting factors of the subdivision scheme, we keep the underlying uniform scheme intact. Our method is based upon introducing additional control points on well-chosen locations, with optional interactive user control over the tangent plane (or surface normal) and the tension of the surface near the interpolating control points. Although this paper is concentrating on the Catmull-Clark scheme, the proposed techniques can be extended to other subdivision schemes.
{"title":"Turning the approximating Catmull-Clark subdivision scheme into a locally interpolating surface modeling tool","authors":"J. Claes, Koen Beets, F. Reeth, A. Iones, A. Krupkin","doi":"10.1109/SMA.2001.923374","DOIUrl":"https://doi.org/10.1109/SMA.2001.923374","url":null,"abstract":"Recursive subdivision schemes have become one of the most important paradigms to model 3D surfaces of arbitrary topology used in computer graphics applications. A number of researchers, both with a mathematical background and from the computer graphics community, have added-and still are adding-different algorithms and features to further improve their capabilities. This paper describes a new modeling tool, providing the possibility to locally choose an interpolating variant of the conventionally approximating Catmull-Clark (1978) subdivision scheme. Our approach combines the advantages of approximating schemes with the precise control of interpolating schemes. Unlike other solutions that mostly narrow down to locally change the weighting factors of the subdivision scheme, we keep the underlying uniform scheme intact. Our method is based upon introducing additional control points on well-chosen locations, with optional interactive user control over the tangent plane (or surface normal) and the tension of the surface near the interpolating control points. Although this paper is concentrating on the Catmull-Clark scheme, the proposed techniques can be extended to other subdivision schemes.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"C-23 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":"126478608","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}
B. Morse, T. Yoo, P. Rheingans, David T. Chen, K. Subramanian
Describes algebraic methods for creating implicit surfaces using linear combinations of radial basis interpolants to form complex models from scattered surface points. Shapes with arbitrary topology are easily represented without the usual interpolation or aliasing errors arising from discrete sampling. These methods were first applied to implicit surfaces by V.V. Savchenko, et al. (1995) and later developed independently by G. Turk and J.F. O'Brien (1998) as a means of performing shape interpolation. Earlier approaches were limited as a modeling mechanism because of the order of the computational complexity involved. We explore and extend these implicit interpolating methods to make them suitable for systems of large numbers of scattered surface points by using compactly supported radial basis interpolants. The use of compactly supported elements generates a sparse solution space, reducing the computational complexity and making the technique practical for large models. The local nature of compactly supported radial basis functions permits the use of computational techniques and data structures such as k-d trees for spatial subdivision, promoting fast solvers and methods to divide and conquer many of the subproblems associated with these methods. Moreover, the representation of complex models permits the exploration of diverse surface geometry. This reduction in computational complexity enables the application of these methods to the study of the shape properties of large, complex shapes.
{"title":"Interpolating implicit surfaces from scattered surface data using compactly supported radial basis functions","authors":"B. Morse, T. Yoo, P. Rheingans, David T. Chen, K. Subramanian","doi":"10.1109/SMA.2001.923379","DOIUrl":"https://doi.org/10.1109/SMA.2001.923379","url":null,"abstract":"Describes algebraic methods for creating implicit surfaces using linear combinations of radial basis interpolants to form complex models from scattered surface points. Shapes with arbitrary topology are easily represented without the usual interpolation or aliasing errors arising from discrete sampling. These methods were first applied to implicit surfaces by V.V. Savchenko, et al. (1995) and later developed independently by G. Turk and J.F. O'Brien (1998) as a means of performing shape interpolation. Earlier approaches were limited as a modeling mechanism because of the order of the computational complexity involved. We explore and extend these implicit interpolating methods to make them suitable for systems of large numbers of scattered surface points by using compactly supported radial basis interpolants. The use of compactly supported elements generates a sparse solution space, reducing the computational complexity and making the technique practical for large models. The local nature of compactly supported radial basis functions permits the use of computational techniques and data structures such as k-d trees for spatial subdivision, promoting fast solvers and methods to divide and conquer many of the subproblems associated with these methods. Moreover, the representation of complex models permits the exploration of diverse surface geometry. This reduction in computational complexity enables the application of these methods to the study of the shape properties of large, complex shapes.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"88 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":"116790923","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}
In this paper we introduce a new algorithm for simplification of polygonal meshes. It generates a variable resolution structure called hierarchical 4-K mesh. This structure is a powerful representation for non-uniform level of detail that among other things, allows simple and efficient extraction of conforming meshes.
{"title":"Mesh simplification using four-face clusters","authors":"L. Velho","doi":"10.1109/SMA.2001.923391","DOIUrl":"https://doi.org/10.1109/SMA.2001.923391","url":null,"abstract":"In this paper we introduce a new algorithm for simplification of polygonal meshes. It generates a variable resolution structure called hierarchical 4-K mesh. This structure is a powerful representation for non-uniform level of detail that among other things, allows simple and efficient extraction of conforming meshes.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"72 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":"126553486","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}
Given a polygonal mesh with a set of tagged control polygons, a subdivision surface that interpolates the B-spline curves of these control polygons can be obtained by constructing a set of polygonal complexes, each of which converges to one of the given curves. The construction process will geometrically and topologically disturb the initial and/or the subdivided polygonal meshes in the vicinity of the polygonal complexes. This may result in poorly shaped surfaces across the interpolated curves. Based on signal fairing, this paper describes a method to fair such a surface and paves the way to achieve further constraints such as interpolating curves with predefined tangent plane or cross curvature.
{"title":"Fairing recursive subdivision surfaces with curve interpolation constraints","authors":"A. Nasri, Tae-wan Kim, Kunwoo Lee","doi":"10.1109/SMA.2001.923375","DOIUrl":"https://doi.org/10.1109/SMA.2001.923375","url":null,"abstract":"Given a polygonal mesh with a set of tagged control polygons, a subdivision surface that interpolates the B-spline curves of these control polygons can be obtained by constructing a set of polygonal complexes, each of which converges to one of the given curves. The construction process will geometrically and topologically disturb the initial and/or the subdivided polygonal meshes in the vicinity of the polygonal complexes. This may result in poorly shaped surfaces across the interpolated curves. Based on signal fairing, this paper describes a method to fair such a surface and paves the way to achieve further constraints such as interpolating curves with predefined tangent plane or cross curvature.","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":"128979543","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}
The paper presents a novel approach for accurate polygonization of implicit surfaces with sharp features. The approach is based on mesh evolution towards a given implicit surface with simultaneous control of the mesh vertex positions and mesh normals.
{"title":"Dynamic meshes for accurate polygonization of implicit surfaces with sharp features","authors":"Y. Ohtake, A. Belyaev, A. Pasko","doi":"10.1109/SMA.2001.923377","DOIUrl":"https://doi.org/10.1109/SMA.2001.923377","url":null,"abstract":"The paper presents a novel approach for accurate polygonization of implicit surfaces with sharp features. The approach is based on mesh evolution towards a given implicit surface with simultaneous control of the mesh vertex positions and mesh normals.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"2 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":"127723960","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}
C. Rocchini, Paolo Cignoni, F. Ganovelli, C. Montani, P. Pingi, Roberto Scopigno
The paper presents a simple and efficient algorithm for the removal of small topological inconsistencies and high frequency details from surface models. The method, called marching intersections (MI), adopts a volumetric approach and acts as a resampling filter. All the intersection points between the input model and the lines of a user selected 3D reference grid are located and then, beginning from these intersections, an output surface is reconstructed. MI, which presents good characteristics in terms of efficiency, compactness, and quality of the output models, can be also used: for the conversion between different representation schemes; to perform logical operations on geometric models; for the topological simplification of surfaces; and for the simplification of huge meshes, i.e. meshes too large to be allocated in main memory during the simplification process. All these aspects are discussed in the paper and timing and graphic results are presented.
{"title":"Marching intersections: an efficient resampling algorithm for surface management","authors":"C. Rocchini, Paolo Cignoni, F. Ganovelli, C. Montani, P. Pingi, Roberto Scopigno","doi":"10.1109/SMA.2001.923401","DOIUrl":"https://doi.org/10.1109/SMA.2001.923401","url":null,"abstract":"The paper presents a simple and efficient algorithm for the removal of small topological inconsistencies and high frequency details from surface models. The method, called marching intersections (MI), adopts a volumetric approach and acts as a resampling filter. All the intersection points between the input model and the lines of a user selected 3D reference grid are located and then, beginning from these intersections, an output surface is reconstructed. MI, which presents good characteristics in terms of efficiency, compactness, and quality of the output models, can be also used: for the conversion between different representation schemes; to perform logical operations on geometric models; for the topological simplification of surfaces; and for the simplification of huge meshes, i.e. meshes too large to be allocated in main memory during the simplification process. All these aspects are discussed in the paper and timing and graphic results are presented.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"262 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":"130186312","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}
Freeform features can be regarded as key elements of shape modeling. Commonly, features are defined, controlled and computed using parameters. We propose a feature formulation strictly based on the parameterization, as a mapping from an arbitrary set to some domain of interest. This formalism accommodates many of the common representation forms and in addition allows: the uniform definition of freeform features; the analysis of feature properties, such as their spatial coverage, differentiability, uniqueness, overlap; and the comparison of alternative parameterizations for a given type of feature, regarding user control and computation. We have investigated in detail two feature types, the ridge and the hole. The proposed parameterizations indeed provide both interactive control and automatic feature extraction, are the key functions of a flexible forward/backward design support tool. Numerical results of the freeform feature parameter extraction process are presented.
{"title":"Parameterization of freeform features","authors":"J. Vergeest, I. Horváth, S. Spanjaard","doi":"10.1109/SMA.2001.923371","DOIUrl":"https://doi.org/10.1109/SMA.2001.923371","url":null,"abstract":"Freeform features can be regarded as key elements of shape modeling. Commonly, features are defined, controlled and computed using parameters. We propose a feature formulation strictly based on the parameterization, as a mapping from an arbitrary set to some domain of interest. This formalism accommodates many of the common representation forms and in addition allows: the uniform definition of freeform features; the analysis of feature properties, such as their spatial coverage, differentiability, uniqueness, overlap; and the comparison of alternative parameterizations for a given type of feature, regarding user control and computation. We have investigated in detail two feature types, the ridge and the hole. The proposed parameterizations indeed provide both interactive control and automatic feature extraction, are the key functions of a flexible forward/backward design support tool. Numerical results of the freeform feature parameter extraction process are presented.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"31 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":"129488890","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}
Function representation (FRep) allows for the construction of quite complex shapes, such as isosurfaces of real-valued functions composed using functionally defined primitives and operations. Calculating such functions in complex cases can be very time-consuming. Interactive extraction and visualization of isosurfaces for them can hardly be imagined. In this paper, we present a method for interactive navigation through a "sculpture garden" containing non-intersecting FRep objects defined in terms of the specialized high-level language HyperFun. Before the actual isosurface extraction and visualization occurs, the objects are voxelized on a regular 3D grid with the possibility of further adaptive voxelization. The polygonization employs a hierarchical representation of the voxelized data and a view-dependent isosurface reconstruction at different levels of detail. To speed up the extraction process, an isosurface is constructed only in the visible part of the data set, with its updates performed incrementally as the observer moves. Due to the low pre-processing costs required for isosurface mesh construction, it is possible to visualize time-dependent objects, if the hardware is capable of calculating the updates in real time.
{"title":"Fast navigation through an FRep sculpture garden","authors":"M. Kazakov, A. Pasko, V. Adzhiev","doi":"10.1109/SMA.2001.923381","DOIUrl":"https://doi.org/10.1109/SMA.2001.923381","url":null,"abstract":"Function representation (FRep) allows for the construction of quite complex shapes, such as isosurfaces of real-valued functions composed using functionally defined primitives and operations. Calculating such functions in complex cases can be very time-consuming. Interactive extraction and visualization of isosurfaces for them can hardly be imagined. In this paper, we present a method for interactive navigation through a \"sculpture garden\" containing non-intersecting FRep objects defined in terms of the specialized high-level language HyperFun. Before the actual isosurface extraction and visualization occurs, the objects are voxelized on a regular 3D grid with the possibility of further adaptive voxelization. The polygonization employs a hierarchical representation of the voxelized data and a view-dependent isosurface reconstruction at different levels of detail. To speed up the extraction process, an isosurface is constructed only in the visible part of the data set, with its updates performed incrementally as the observer moves. Due to the low pre-processing costs required for isosurface mesh construction, it is possible to visualize time-dependent objects, if the hardware is capable of calculating the updates in real time.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"6 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":"125061321","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
扫码关注我们
求助内容：
应助结果提醒方式：