Proceedings International Conference on Shape Modeling and Applications

7-11 May 2001

Filter Results

Displaying Results 1 - 25 of 38
  • Proceedings International Conference on Shape Modeling and Applications

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (191 KB)
    Freely Available from IEEE
  • The 'thermodynamics' of shape

    Publication Year: 2001, Page(s):2 - 8
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (835 KB) | HTML iconHTML

    Shape modeling is still in its infancy. Fifty years of research has produced only a few isolated techniques that describe a tiny subset of shapes usefully. We need to find some more general principles that coordinate shape description just as scientific laws coordinate a description of nature. Underlying the laws of science are even more general principles of thermodynamics. Although we are not ye... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognizing geometric patterns for beautification of reconstructed solid models

    Publication Year: 2001, Page(s):10 - 19
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB) | HTML iconHTML

    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. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameterization of freeform features

    Publication Year: 2001, Page(s):20 - 29
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (845 KB) | HTML iconHTML

    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 fre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handle and hole improvement by using new corner cutting subdivision scheme with tension

    Publication Year: 2001, Page(s):32 - 41
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1071 KB) | HTML iconHTML

    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. Fir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Turning the approximating Catmull-Clark subdivision scheme into a locally interpolating surface modeling tool

    Publication Year: 2001, Page(s):42 - 48
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (595 KB) | HTML iconHTML

    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 mode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fairing recursive subdivision surfaces with curve interpolation constraints

    Publication Year: 2001, Page(s):49 - 59
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (738 KB) | HTML iconHTML

    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 o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implicit surfaces that interpolate

    Publication Year: 2001, Page(s):62 - 71
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1152 KB) | HTML iconHTML

    Implicit surfaces are often created by summing a collection of radial basis functions. Researchers have begun to create implicit surfaces that exactly interpolate a given set of points by solving a simple linear system to assign weights to each basis function. Due to their ability to interpolate, these implicit surfaces are more easily controllable than traditional "blobby" implicits. There are se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic meshes for accurate polygonization of implicit surfaces with sharp features

    Publication Year: 2001, Page(s):74 - 81
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (997 KB) | HTML iconHTML

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subdivision-curve primitives: a new solution for interactive implicit modeling

    Publication Year: 2001, Page(s):82 - 88
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    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 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interpolating implicit surfaces from scattered surface data using compactly supported radial basis functions

    Publication Year: 2001, Page(s):89 - 98
    Cited by:  Papers (96)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (833 KB) | HTML iconHTML

    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 late... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Lipschitz function evaluation for CSG implicit surfaces

    Publication Year: 2001, Page(s):99 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (433 KB) | HTML iconHTML

    The rendering of an implicit surface requires many function evaluations of the underlying implicit function. The time efficiency of the rendering is dominated by the number of function evaluations times the efficiency of these evaluations. If the implicit surface is created by means of a constructive solid geometry (CSG) model, the function evaluations can be made more efficient if the underlying ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast navigation through an FRep sculpture garden

    Publication Year: 2001, Page(s):104 - 113
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1290 KB) | HTML iconHTML

    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 interact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implicit extrusion fields: general concepts and some simple applications

    Publication Year: 2001, Page(s):114 - 123
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1321 KB) | HTML iconHTML

    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 field... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape modeling using homotopy

    Publication Year: 2001, Page(s):126 - 133
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (663 KB) | HTML iconHTML

    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 necessi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On evolute cusps and skeleton bifurcations

    Publication Year: 2001, Page(s):134 - 140
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (569 KB) | HTML iconHTML

    Consider a 2D smooth closed curve evolving in time, the skeleton (medial axis) of the figure bounded by the curve, and the evolute of the curve. A new branch of the skeleton can appear/disappear when an evolute cusp intersects the skeleton. In this paper, we describe exact conditions of the skeleton bifurcations corresponding to such intersections. Similar results are also obtained for 3D surfaces... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Re-meshing techniques for topological analysis

    Publication Year: 2001, Page(s):142 - 152
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (979 KB) | HTML iconHTML

    A method for the extraction of the extended Reeb graph (ERG) from a closed 3D triangular mesh is presented. The ERG encodes the relationships among critical points of the height function associated to the mesh, and it can represent isolated as well as degenerate critical points. The extraction process is based on a re-meshing strategy of the original mesh, which is forced to follow contour levels.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matching 3D models with shape distributions

    Publication Year: 2001, Page(s):154 - 166
    Cited by:  Papers (177)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1278 KB) | HTML iconHTML

    Measuring the similarity between 3D shapes is a fundamental problem, with applications in computer vision, molecular biology, computer graphics, and a variety of other fields. A challenging aspect of this problem is to find a suitable shape signature that can be constructed and compared quickly, while still discriminating between similar and dissimilar shapes. In this paper, we propose and analyze... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A geometric approach to 3D object comparison

    Publication Year: 2001, Page(s):167 - 175
    Cited by:  Papers (36)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (829 KB) | HTML iconHTML

    Along with the development of 3D acquisition devices and methods and the increasing number of available 3D objects, new tools are necessary to automatically analyze, search and interpret these models. In this paper, we describe a novel geometric approach to 3D object comparison and analysis. To compare two objects geometrically, we first properly position and align the objects. After solving this ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Machining feature-based comparisons of mechanical parts

    Publication Year: 2001, Page(s):176 - 185
    Cited by:  Papers (23)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (941 KB) | HTML iconHTML

    Solid models are the critical data elements in modern computer-aided design (CAD) environments, describing the shape and form of manufactured artifacts. Their growing ubiquity has created new problems in how to effectively manage the many models that are now stored in the digital libraries of large design and manufacturing enterprises. Existing techniques from the engineering literature and from i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape matching: similarity measures and algorithms

    Publication Year: 2001, Page(s):188 - 197
    Cited by:  Papers (91)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB) | HTML iconHTML

    Shape matching is an important ingredient in shape retrieval, recognition and classification, alignment and registration, and approximation and simplification. This paper treats various aspects that are needed to solve shape matching problems: choosing the precise problem, selecting the properties of the similarity measure that are needed for the problem, choosing the specific similarity measure, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mesh simplification using four-face clusters

    Publication Year: 2001, Page(s):200 - 208
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (753 KB) | HTML iconHTML

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local control for mesh morphing

    Publication Year: 2001, Page(s):209 - 215
    Cited by:  Papers (13)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB) | HTML iconHTML

    Mesh morphing techniques are capable of producing a sequence of meshes, gradually changing from a source to a target shape. However, current techniques do not allow to describe the local behavior of the morph. A solution to this problem is presented. The main idea is to describe mesh geometry in a differential way, thus, insertion of local features from one shape into another does not suffer from ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling subdivision control meshes for creating cartoon faces

    Publication Year: 2001, Page(s):216 - 225
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB) | HTML iconHTML

    Modeling three-dimensional faces on the computer has been an interesting yet challenging problem. This paper presents a method for creating cartoon faces by using a subdivision scheme. We use set-operations for conceptual design of subdivision control meshes. To ensure the quality of the control mesh, we have eliminated high valenced extraordinary vertices since smoothness of the surface decreases... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient processing of large 3D meshes

    Publication Year: 2001, Page(s):228 - 237
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1011 KB) | HTML iconHTML

    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 acce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.