By Topic

2003 International Conference on Geometric Modeling and Graphics, 2003. Proceedings

16-18 July 2003

Filter Results

Displaying Results 1 - 25 of 33
  • Proceeding 2003 International Conference on Geometric Modeling and Graphics - GMAG 2003

    Publication Year: 2003
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB)

    The following topics are discussed: geometrical modeling and graphics applications; graphics algorithms; curve design; surface design; and computer aided applications. View full abstract»

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

    Publication Year: 2003, Page(s): 208
    Request permission for commercial reuse | PDF file iconPDF (150 KB)
    Freely Available from IEEE
  • An unified framework to solve the broad and narrow phases of the collision detection problem in virtual prototype environments

    Publication Year: 2003, Page(s):130 - 136
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (314 KB) | HTML iconHTML

    The automatic recognition of geometric constraints during user interaction in virtual assembly and maintenance operations relies in the determination of intersecting surfaces between virtual prototypes. This is a central problem in many virtual prototype applications, where it is necessary to find collisions precisely and interactively. This paper presents an unified framework, for the broad and n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating well behaved meshes for parameterized surfaces

    Publication Year: 2003, Page(s):56 - 61
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    This paper gives first a survey of parametric representations that are often used in computer-aided geometric design. These include B-spline, NURBS, tabulated cylinder, trimmed surface and surface of revolution. Secondly, the paper deals with applications in surface mesh generation. The parameter domain is triangulated using Delaunay-Voronoi meshing and the spatial mesh is refined according to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improvement in decimation of triangle meshes for level of detail

    Publication Year: 2003, Page(s):123 - 128
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    Simplifying polygonal models to achieve a constant frame rate or to generate an ideal size of an object proportional to its viewing distance is one of the many techniques used in 3D visualizations these days. In this paper, we have selected a decimation algorithm to be further enhanced by introducing other techniques to obtain a better output. In our technique, parts of the characterization vertic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bump map generation from 3D scan data

    Publication Year: 2003, Page(s):180 - 185
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2993 KB) | HTML iconHTML

    A 3D scanner creates a large amount of point data during modeling process and, therefore, it requires point data reduction. However, during such process, model details, like the relief and surface pattern, is often removed. Texturing can add surface details that are usually too complex to be modeled directly using images, numerical functions or other source of data. Bump mapping can represent thre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extensible point location algorithm

    Publication Year: 2003, Page(s):84 - 89
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1873 KB) | HTML iconHTML

    We present a general walkthrough point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked list as a data structure to store the polyhedra. The generality of the approach stems from using barycentric coordinates to extract local information about the location of the query point that allows a 'gradient descent'-lik... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data organization for broadcasting in mobile computing

    Publication Year: 2003, Page(s):49 - 54
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    The rapidly expanding technology of cellular communications, wireless LAN (local area network), wireless data networks and satellite will give mobile users capability of accessing information anywhere and anytime. One of the important components of this environment is the server with broadcasting capabilities. Data are fetched from the server and being broadcast to the air. Mobile users keep liste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Family of G2 cubic transition curves

    Publication Year: 2003, Page(s):117 - 122
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB) | HTML iconHTML

    Walton & Meek (1996) obtained a fair G2 cubic transition spiral curve joining a straight line and a circle. We derive a family of cubic transition spiral curves joining them. We not only simplify and extend their analysis but also provide more degrees of freedom with less restrictive shape control parameters. The idea of straight line to circle transition has been extended to straight l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthetic modeling system architecture

    Publication Year: 2003, Page(s):174 - 179
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (298 KB) | HTML iconHTML

    Actual CAD (computer-aided design) systems are still monolithic and are based on complex geometrical models. Moreover, they have complex computer-human interfaces, which are an obstacle to the modeling task for a nonexpert end user. We implement an approach that takes advantage of Web possibilities and provides a novice end-user with an easy-to-use system. We are thus interested in providing a tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Saudi Arabian license plate recognition system

    Publication Year: 2003, Page(s):36 - 41
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB) | HTML iconHTML

    A license plate recognition (LPR) system is one kind of intelligent transport systems and is of considerable interest because of its potential applications to areas such as highway electronic toll collection, traffic monitoring system and so on. This paper proposes an automatic license plate recognition system for Saudi Arabian license plates. The system captures the images of the vehicles with a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconstruction of a 3D solid model from orthographic projections

    Publication Year: 2003, Page(s):75 - 82
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB) | HTML iconHTML

    This paper describes an approach for the automatic reconstruction of three-dimensional (3D) solid models from two-dimensional (2D) engineering drawings. The main features of the algorithm are to improve the speed of the reconstruction process and to generate a sequence of solutions. The research proposes an approach, which is a hybrid of the boundary representation (B-rep) and constructive solid g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message recovery signature scheme using complementary elliptic curves

    Publication Year: 2003, Page(s):106 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this concept is hard to solved; therefore, this criteria has given mathematicians a courage to explore this area of research. In previous paper (Yew et al., 2003), we have shown a new method for embedding plain-texts using a co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linear complexity algorithm for the Bernstein basis

    Publication Year: 2003, Page(s):162 - 167
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB) | HTML iconHTML

    In this paper we obtain a new corner cutting algorithm for the evaluation of polynomials represented in the Bernstein-Bezier form. This algorithm has linear time complexity, in contrast to the quadratic time complexity of the usual de Casteljau algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Web-based system using trade knowledge

    Publication Year: 2003, Page(s):22 - 27
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (665 KB) | HTML iconHTML

    CAD systems are still evolving, using new dialog approaches and improving models (features, functional modeling, knowledge management ...). The integration of the different software (CAD, simulation, CAM ...) is in many cases artificial. We describe in this paper an application whose goals are the following: (1) define a trade oriented intuitive man-machine dialog ; then a knowledge-based engineer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast and memory-efficient method for LOD modeling of polygonal models

    Publication Year: 2003, Page(s):137 - 142
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    Ever growing complexity of polygonal models hinders the rendering and manipulation of such models on available graphics hardware resources. LOD (level of detail) management only can make such models suitable for various applications. We propose an automatic method for generating LODs of a given polygonal model that is based on edge collapse operation. In an edge collapse algorithm, the way how to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating blending surfaces with an iterative solution to fourth order PDE

    Publication Year: 2003, Page(s):62 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB) | HTML iconHTML

    In this paper, we develop an efficient method for surface blending. It is based on our previously proposed fourth order partial differential equation (PDE) with three vector-valued shape parameters. In order to solve this PDE efficiently, we have previously developed a closed form resolution method. However, a closed form solution only exists in a small number of situations, and therefore the appl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FreeSculptor: a computer-aided freeform design environment

    Publication Year: 2003, Page(s):188 - 194
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (433 KB) | HTML iconHTML

    This paper proposes an interactive freeform design modeling system, named FreeSculptor, which comprises 2D (two-dimensional) constraint-based sketching, advanced 3D (three-dimensional) modeling and haptic force-feedback devices. FreeSculptor adopts energy-based deformable modeling, which allows users to sculpt 3D virtual objects interactively. We investigate interaction metaphors for promoting cre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric design and space planning using the marching squares and marching cube algorithms

    Publication Year: 2003, Page(s):90 - 95
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    In the paper we present a method for area and volume approximation using modifications to the marching cubes algorithm of Lorensen and Cline (1987). Approximations to two and three-dimensional objects using marching squares and marching cubes have been covered extensively. Given an approximation to an object, an algorithm is presented which allows a simple method that can approximate the area or v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Normalization and exploration design method of Islamic geometric patterns

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

    The primary purpose of this paper is to present an innovative method to design and explore Islamic Geometric Patterns (IGP) based on normalization (formulation) of the sub-motif grid (the smallest portion of the symmetrical unit pattern) within the unit patterns that literally hold the entire form of the unit pattern. Conventional design language studies have merely focused on the base principles ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance, and accuracy improvements in algorithms for centred, axes-aligned ellipses

    Publication Year: 2003, Page(s):111 - 116
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (791 KB) | HTML iconHTML

    Two new algorithms for nonparametric axes-aligned ellipses will be presented, addressing the question of accuracy and efficiency in the existing algorithms. Both algorithms are free of errors arising from slope approximation. However, the merit of the first algorithm is its accuracy as well as giving the best performance for the special class of ellipses under consideration. The second algorithm i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual and complexity analysis of the Extended Loop subdivision scheme

    Publication Year: 2003, Page(s):168 - 173
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (578 KB) | HTML iconHTML

    This paper is a study of a new subdivision scheme - Extended Loop $proposed within the MPEG-4 multimedia compression standard by Superscape. Extended Loop is a scheme designed for subdividing arbitrary polygons and is a hybrid between Loop for triangular meshes and Catmull-Clark for quad meshes. Therefore, we compare the visual appearance and complexity of Extended Loop with these traditional sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Offline Arabic text recognition system

    Publication Year: 2003, Page(s):30 - 35
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Optical character recognition (OCR) systems provide human-machine interaction and are widely used in many applications. Much research has already been done on the recognition of Latin, Chinese and Japanese characters. Against this background, it has been experienced that only few papers have specifically addressed to the problem of Arabic text recognition and languages using Arabic script like Urd... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proposition of two evolutionist approaches - genetic algorithm and neural network - to solve CSP

    Publication Year: 2003, Page(s):143 - 148
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (262 KB) | HTML iconHTML

    Within the framework of the constraint satisfaction problem (CSP) resolution, we propose two methods based on the principle of evolutionist algorithms. The resolution is carried out under two tests. Initially, we present a genetic algorithm, which uses original operators, based on personal heuristic, and we propose, thereafter, an algorithm based on the conception of a basic neural network able to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accurate silhouettes - do polyhedral models suffice?

    Publication Year: 2003, Page(s):69 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (335 KB) | HTML iconHTML

    We investigate whether polyhedral models suffice for accurate silhouette computation. Therefore, we set up a theoretical framework, a mathematical foundation, to compare various algorithms computing silhouettes on spatial and topological accuracy. Within this carefully constructed environment, we can argue on a formal basis why some silhouette-computing algorithms are better than others. In doing ... View full abstract»

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