By Topic

12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings.

6-8 Oct. 2004

Filter Results

Displaying Results 1 - 25 of 52
  • Direct anisotropic quad-dominant remeshing

    Publication Year: 2004, Page(s):207 - 216
    Cited by:  Papers (19)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1887 KB) | HTML iconHTML

    We present an extension of the anisotropic polygonal remeshing technique developed by Alliez et al. (2003). Our algorithm does not rely on a global parameterization of the mesh and therefore is applicable to arbitrary genus surfaces. We show how to exploit the structure of the original mesh in order to perform efficiently the proximity queries required in the line integration phase, thus improving... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern oriented remeshing for Celtic decoration

    Publication Year: 2004, Page(s):199 - 206
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3067 KB) | HTML iconHTML

    Decorating arbitrary meshes with Celtic knots requires polygonal meshes with regular connectivity and close to regular face geometry. Because these properties are often irregular, especially in scanned or reconstructed models, the Celtic knots produced may be erratic and undesirable. In this paper we remesh models based on planar tilings defined by the user. Such pattern-oriented surfaces allow us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time 3D fluid simulation on GPU with complex obstacles

    Publication Year: 2004, Page(s):247 - 256
    Cited by:  Papers (19)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB) | HTML iconHTML

    In this paper, we solve the 3D fluid dynamics problem in a complex environment by taking advantage of the parallelism and programmability of GPU. In difference from other methods, innovation is made in two aspects. Firstly, more general boundary conditions could be processed on GPU in our method. By the method, we generate the boundary from a 3D scene with solid clipping, making the computation ru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust method for shape-based 3D model retrieval

    Publication Year: 2004, Page(s):3 - 9
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (567 KB) | HTML iconHTML

    Proliferation of 3D models necessitates developing efficient methods for indexing or retrieving the models in a large database. Many previous methods for this purpose defined functions on concentric spheres as approximation of 3D geometry for spherical harmonic transform (SHT). In this paper, we point out that this is not robust as the surface of a model may shift between different shells under pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Normal based estimation of the curvature tensor for triangular meshes

    Publication Year: 2004, Page(s):288 - 297
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2591 KB) | HTML iconHTML

    We introduce a new technique for estimating the curvature tensor of a triangular mesh. The input of the algorithm is only a single triangle equipped with its (exact or estimated) vertex normals. This way we get a smooth junction of the curvature tensor inside each triangle of the mesh. We show that the error of the new method is comparable with the error of a cubic fitting approach if the incorpor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware-accelerated reconstruction of polygonal isosurface representations on unstructured grids

    Publication Year: 2004, Page(s):186 - 195
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    Volume visualization using isosurface extraction is a well-researched topic. Research demonstrated that even for unstructured grids peak performances of millions of tetrahedra per second can be achieved by exploiting the parallel processing capabilities of modern GPUs. In this paper we present a hardware-accelerated solution that further improves the extraction performance. In contrary to existing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • M3: marker-free model reconstruction and motion tracking from 3D voxel data

    Publication Year: 2004, Page(s):101 - 110
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (719 KB) | HTML iconHTML

    In computer animation, human motion capture from video is a widely used technique to acquire motion parameters. The acquisition process typically requires an intrusion into the scene in the form of optical markers which are used to estimate the parameters of motion as well as the kinematic structure of the performer. Marker-free optical motion capture approaches exist, but due to their dependence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Snaking across 3D meshes

    Publication Year: 2004, Page(s):87 - 93
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1339 KB) | HTML iconHTML

    We present a method of moving snake curves over 3D meshes. Our snake is made from the vertices of a triangular mesh, so it never leaves the 3D surface, eliminating any need for mapping on to ID and subsequent remapping on to the 3D mesh. Our snake finds features related to Gaussian curvature, or ridges and valleys. We move each vertex of the snake to one of its neighbor vertices on the mesh, while... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Radiosity for point-sampled geometry

    Publication Year: 2004, Page(s):152 - 159
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1099 KB) | HTML iconHTML

    In this paper, we propose a radiosity method for the point-sampled geometry to compute diffuse inter reflection of light. Most traditional radiosity methods subdivide the surfaces of objects into small elements such as quadrilaterals. However, the point-sampled geometry includes no explicit information about surfaces, presenting a difficulty in applying the traditional approach to the point-sample... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dual marching cubes: primal contouring of dual grids

    Publication Year: 2004, Page(s):70 - 76
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (839 KB) | HTML iconHTML

    We present a method for contouring an implicit function using a grid topologically dual to structured grids such as octrees. By aligning the vertices of the dual grid with the features of the implicit function, we are able to reproduce thin features of the extracted surface without excessive subdivision required by methods such as marching cubes or dual contouring. Dual marching cubes produces a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive real-time 3D acquisition and contour tracking within a multiple structured light system

    Publication Year: 2004, Page(s):361 - 370
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1374 KB) | HTML iconHTML

    Active 3D acquisition setups currently capture 3D data from a single viewpoint. We propose a system that supports the effective use of multiple structured light modules placed around the object of interest. We show how oppositely positioned modules could work together and how we can avoid those parts of the background that unnecessarily take up computation time. Key to the setup is having the stru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GPU-based tolerance volumes for mesh processing

    Publication Year: 2004, Page(s):237 - 243
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (573 KB) | HTML iconHTML

    In an increasing number of applications triangle meshes represent a flexible and efficient alternative to traditional NURBS-based surface representations. Especially in engineering applications it is crucial to guarantee that a prescribed approximation tolerance to a given reference geometry is respected for any combination of geometric algorithms that are applied when processing a triangle mesh. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent mesh scissoring using 3D snakes

    Publication Year: 2004, Page(s):279 - 287
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1345 KB) | HTML iconHTML

    Mesh partitioning and parts extraction have become key ingredients for many mesh manipulation applications both manual and automatic. In this paper, we present an intelligent scissoring operator for meshes which supports both automatic segmentation and manual cutting. Instead of segmenting the mesh by clustering, our approach concentrates on finding and defining the contours for cutting. This appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unlifted loop subdivision wavelets

    Publication Year: 2004, Page(s):25 - 33
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1415 KB) | HTML iconHTML

    In this paper, we propose a new wavelet scheme for loop subdivision surfaces. The main idea enabling our wavelet construction is to extend the subdivision rules to be invertible, thus executing each inverse subdivision step in the reverse order makes up the wavelet decomposition rule. As opposed to other existing wavelet schemes for loop surfaces, which require solving a global sparse linear syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Glare generation based on wave optics

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

    This paper proposes a general method of glare generation based on wave optics. A glare image is regarded as a result of Fraunhofer diffraction, which is equivalent to a 2D Fourier transform of the image of given apertures or obstacles. In conventional methods, the shapes of glare images are categorized according to their source apertures, such as pupils and eyelashes and their basic shapes (e.g. h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-dimensional transfer functions for interactive 3D flow visualization

    Publication Year: 2004, Page(s):177 - 185
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (594 KB) | HTML iconHTML

    Transfer functions are a standard technique used in volume rendering to assign color and opacity to a volume of a scalar field. Multidimensional transfer functions (MDTFs) have proven to be an effective way to extract specific features with subtle properties. As 3D texture-based methods gain widespread popularity for the visualization of steady and unsteady flow field data, there is a need to defi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accurate Minkowski sum approximation of polyhedral models

    Publication Year: 2004, Page(s):392 - 401
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (767 KB) | HTML iconHTML

    We present an algorithm to approximate the 3D Minkowski sum of polyhedral objects. Our algorithm decomposes the polyhedral objects into convex pieces, generates pairwise convex Minkowski sums and computes their union. We approximate the union by generating a voxel grid, computing signed distance on the grid points and performing isosurface extraction from the distance field. The accuracy of the al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification for Fourier volume rendering

    Publication Year: 2004, Page(s):51 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1388 KB) | HTML iconHTML

    In the last decade, Fourier volume rendering (FVR) has obtained considerable attention due to its O(N2logN) rendering complexity, where O(N3) is the volume size. Although ordinary volume rendering has O(N3) rendering complexity, it is still preferred over FVR for the main reason, that FVR offers bad localization of spatial structures. As a consequence, it was assum... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-photorealistic real-time rendering of characteristic faces

    Publication Year: 2004, Page(s):339 - 347
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1958 KB) | HTML iconHTML

    We propose a system for real-time sketching of human faces. On the basis of a three-dimensional description of a face model, characteristic line strokes are extracted and represented in an artistic way. In order to enrich the results with details that cannot be determined analytically from the model surface and anchor strokes are supplemented interactively and are maintained during animation. Beca... View full abstract»

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

    Publication Year: 2004, Page(s):217 - 226
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2033 KB) | HTML iconHTML

    The appearance of computer generated plants has improved significantly due to advances in both modeling and rendering. In this paper we describe a system that further improves the appearance of CG plants by including the tiny hairs that cover many plant organs. A plant skeleton is generated using an L-system and graphically interpreted using generalized cylinders. The individual hairs are then map... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data-driven approach for real-time clothes simulation

    Publication Year: 2004, Page(s):257 - 266
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (799 KB) | HTML iconHTML

    A data-driven approach for real-time processing of clothes, particularly suitable for simulating dresses worn by virtual characters, is proposed. It starts, prior to realtime simulation, by analyzing cloth behavior in relation to the underlying skeleton movement from a pre-simulated sequence of the cloth obtained using any high quality offline simulators. The idea is to use this analysis to find a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Swirling-sweepers: constant-volume modeling

    Publication Year: 2004, Page(s):10 - 15
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (502 KB) | HTML iconHTML

    Swirling-sweepers is a new method for modeling shapes while preserving volume. The artist describes a deformation by dragging a point along a path. The method is independent of the geometric representation of the shape. It preserves volume and avoids self-intersections, both local and global. It is capable of unlimited stretching and the deformation can be constrained to affect only apart of the m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmentation of 3D meshes through spectral clustering

    Publication Year: 2004, Page(s):298 - 305
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (698 KB) | HTML iconHTML

    We formulate and apply spectral clustering to 3D mesh segmentation for the first time and report our preliminary findings. Given a set of mesh faces, an affinity matrix which encodes the likelihood of each pair of faces belonging to the same group is first constructed. Spectral methods then use selected eigenvectors of the affinity matrix or its closely related graph Laplacian to obtain data repre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perceptually based approach for planar shape morphing

    Publication Year: 2004, Page(s):111 - 120
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (594 KB) | HTML iconHTML

    This paper presents an approach for establishing vertex correspondences between two planar shapes. Correspondences are established between the perceptual feature points extracted from both source and target shapes. A similarity metric between two feature points is defined using the intrinsic properties of their local neighborhoods. The optimal correspondence is found by an efficient dynamic progra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mesh modelling with curve analogies

    Publication Year: 2004, Page(s):94 - 98
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (446 KB) | HTML iconHTML

    Modelling by analogy has become a powerful paradigm for editing images. Using a pair of before- and after-example images of a transformation, a system that models by analogy produces analogous transformations on arbitrary new images. This paper brings the expressive power of modelling by analogy to meshes. To avoid the difficulty of specifying fully 3D example meshes, we use curve analogies to pro... View full abstract»

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