By Topic

Proceedings Geometric Modeling and Processing 2000. Theory and Applications

10-12 April 2000

Filter Results

Displaying Results 1 - 25 of 42
  • Proceedings Geometric Modeling and Processing 2000. Theory and Applications

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (88 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2000, Page(s):V - VIII
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • Reverse engineering B-rep models from multiple point clouds

    Publication Year: 2000, Page(s):3 - 12
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (126 KB)

    The procedure of reconstructing conventional engineering objects from multiple-view 3D point clouds is described. Emphasis is put on producing accurate and topologically consistent B-rep models, ready to be used in computer aided design and manufacture. After describing the basic phases of reverse engineering, related algorithmic difficulties are analyzed. Three particular areas are discussed in m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A system for constructing boundary representation solid models from a two-dimensional sketch

    Publication Year: 2000, Page(s):13 - 32
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB)

    This paper describes a system which converts a two-dimensional sketch with hidden lines removed of a single polyhedral object into a boundary representation solid model. The system improves on a previous system by Grimstead (1997) by analysing the sketch for symmetry elements and regularities. It uses the results of this analysis to produce a more plausible topological completion of the hidden par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rapid 3D model acquisition from images of small objects

    Publication Year: 2000, Page(s):33 - 41
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (170 KB)

    This paper describes a system for rapid acquisition of 3D models of objects for use in applications such as CAD and VR. The system consists of an image capturing platform, which comprises a PC-controlled turntable and CCD camera, and associated computer vision and graphics algorithms for 3D model acquisition. An algorithm for accurately recovering 3D points from image sequences is described. Exper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric processing for analysis

    Publication Year: 2000, Page(s):45 - 56
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1156 KB)

    Processing geometric models for finite element analysis is a major factor in the time required to develop and optimise a design. Efficient analysis may require simplification of the geometric model by dimensional reduction (replacing thin sheets or slender bars of material with equivalent line or surface elements) or detail suppression (the removal of small features below the scale of interest in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A feature-based approach to automatic injection mold generation

    Publication Year: 2000, Page(s):57 - 68
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (149 KB)

    This paper presents a feature-based approach to the automatic generation of an injection mold. In the approach, all the molding features of a molded part are recognized first using a universal hint-based feature recognition algorithm, and the optimal parting direction is determined based on the feature model. Then, all the faces related with the parting line are classified into three groups accord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of fabric properties on cloth draping modeling

    Publication Year: 2000, Page(s):69 - 76
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1223 KB)

    Cloth draping is of particular interest in the field of garment engineering. Most cloth draping simulation stresses the visual effects of garment design. However, the accuracy of the draping effect should not be overlooked, particularly for garment manufacturing. The accuracy of the draping behaviour is largely affected by the fabric properties. This paper discusses the issue of incorporating the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A representation independent geometric modeling kernel

    Publication Year: 2000, Page(s):79 - 89
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB)

    This paper is concerned with "open kernel" geometric modelling systems. It uses industrial needs to identify requirements for the geometric objects of a proposed interface. The necessary mixed-dimension cellular objects are formally defined as the fundamental data abstractions for that interface. Such definitions are imperative for the construction of robust functions and the integrity of data tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dimension-driven parameterized design of free form objects

    Publication Year: 2000, Page(s):90 - 100
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (247 KB)

    The paper develops a theoretical basis for dimension-driven parameterized design of free form objects. In traditional parametric computer-aided design (CAD) systems, research is focused on the representation of dimension parameters and constraint satisfaction algorithms. Dimension-driven free form object parameterized design is to obtain a new free form object similar in shape to the old one but w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On families of objects and their semantics

    Publication Year: 2000, Page(s):101 - 111
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (333 KB)

    An approach is presented to define a family of objects in parametric modelling. It avoids an inherent problem of boundary re-evaluation in current parametric modelling systems. Even more important, it offers an effective way to define the properties, or semantics of a family of objects. A family of objects is defined by a prototype feature model, including several types of constraints to precisely... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proximity queries for modeling and manufacturing

    Publication Year: 2000, Page(s):115 - 122
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (134 KB)

    Collision detection and distance calculation are two examples of proximity queries between modelled objects. They are interesting both in their own right, and as useful tools to solve other problems (e.g., robot path planning). They also form useful abstractions away from the underlying representation of a geometric model. This paper considers the solution and use of such problems in geometric mod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance computation between non-convex polyhedra at short range based on discrete Voronoi regions

    Publication Year: 2000, Page(s):123 - 128
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (591 KB)

    An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between two polyhedra, it is important to search efficiently the pair of the triangles which gives the pair of closest points. In our algorithm discrete Voronoi regions are prepared as voxels around a non-convex polyhedron. Each... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A sequence of generalized coordinate systems based on Voronoi diagrams and its application to interpolation

    Publication Year: 2000, Page(s):129 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (161 KB)

    This paper presents a general framework for constructing a variety of multi-dimensional interpolants based on Voronoi diagrams. This framework includes previously known methods such as Sibson's interpolant and Laplace's interpolant; moreover it contains infinitely many new interpolants. Computational experiments suggest that the smoothness can be improved by the proposed generalization. In additio... View full abstract»

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

    Publication Year: 2000, Page(s):141 - 149
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (58 KB)

    Poisson approximation extends the Bernstein-Bezier scheme from polynomials to arbitrary analytic functions. A survey of some old and new results in Poisson approximation is presented with special emphasis on algorithmic techniques for analytic functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of knots for the multi curve B-spline approximation

    Publication Year: 2000, Page(s):150 - 161
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    This article presents a method for multi curve approximation with B-splines. The approximation is formulated as a constrained optimization problem with the least squares error as the objective function and the knot vector as the variables. The method presented in this article is designed to eliminate the well-known lethargic behaviour and to maintain the accuracy of control points. The method for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained C/sup 1/ piecewise bicubic Bezier surface interpolation

    Publication Year: 2000, Page(s):162 - 171
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (231 KB)

    The construction of a C/sup 1/ piecewise bicubic Bezier surface that interpolates a set of data points and lies on the same side of a given plane as the data points is presented. The main tasks in this construction process are the adjustment of the tangent vectors and the determination of the twist vectors at the data points. The tangent vectors are modified by decreasing their magnitudes. The twi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating NURBS curves by arc splines

    Publication Year: 2000, Page(s):175 - 183
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (99 KB)

    It is desirable to approximate a smooth curve by arc splines with the fewest segments within a prescribed tolerance. We present an efficient algorithm for fitting planar smooth curves by arc splines. The main idea is that we construct the optimal arc spline by optimizing the interpolating biarc curve. The scheme consists of three steps: sampling the curve based on consecutive tangent deviation; co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method of shape control of curve design

    Publication Year: 2000, Page(s):184 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (267 KB)

    Constraining an interpolating curve to be bounded in a given region is an important task in curve design. In (Qi Duan et al., 1999) the rational cubic spline with a linear denominator has been used to control the interpolating curves to be bounded in the given region, but it does not work in some cases. This paper deals with the weighted rational cubic spline with a linear denominator for this kin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive formulae for Hermite polynomial approximations to rational Bezier curves

    Publication Year: 2000, Page(s):190 - 197
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (202 KB)

    This paper presents the algorithms for calculating the control points of Hermite polynomial approximation to rational Bezier curves and the recursive formulae between different degree Hermite polynomial approximations based on the close relationship between hybrid polynomial approximation and Hermite polynomial approximation. The error bound for the Hermite polynomial approximation is also obtaine... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust watermarking of polygonal meshes

    Publication Year: 2000, Page(s):201 - 208
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (126 KB)

    This paper presents two variations of a robust watermarking method for general polygonal meshes of arbitrary topology which can be used for copyright protection, tamper proofing or content annotation purposes. The proposed watermark is immune to translation, rotation, scaling or affine transformation of the mesh and is hard to detect unless the exact encoding parameters are disclosed. Several exam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line polygon refining using a low computation subdivision algorithm

    Publication Year: 2000, Page(s):209 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    Subdivision algorithms have been extensively used in computer graphics to produce a more accurate geometry model. For the purpose of integration into the context of a standard graphics pipeline for real-time display, we can only make use of the available information of one triangle. We propose a low computation cost algorithm to subdivide a polygon using vertex coordinates and vertex normal vector... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using most isometric parameterizations for remeshing polygonal surfaces

    Publication Year: 2000, Page(s):220 - 228
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB)

    The importance of triangle meshes with a special kind of connectivity, the so-called subdivision connectivity is still growing. Therefore it is important to develop efficient algorithms for converting a given mesh with arbitrary connectivity into one with subdivision connectivity. We focus on 2-manifold triangle meshes with a boundary and no holes. We discuss the importance of a parametrization wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polyhedral surface smoothing with simultaneous mesh regularization

    Publication Year: 2000, Page(s):229 - 237
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (457 KB)

    A computer graphics object reconstructed from real-world data often contains undesirable noise and small-scale oscillations. An important problem is how to remove the noise and oscillations while preserving desirable geometric features of the object. We develops methods for polyhedral surface smoothing and denoising with simultaneous increasing mesh regularity. We also propose an adaptive smoothin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate shortest path on a polyhedral surface based on selective refinement of the discrete graph and its applications

    Publication Year: 2000, Page(s):241 - 250
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (171 KB)

    A new algorithm is proposed for calculating the approximate shortest path on a polyhedral surface. The method mainly uses Dijkstra's algorithm and is based on selective refinement of the discrete graph of a polyhedron. Although the algorithm is an approximation, it has the significant advantages of being fast, easy to implement, high approximation accuracy, and numerically robust. The approximatio... View full abstract»

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