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
  • 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.
  • 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.
  • 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.
  • GPU-based tolerance volumes for mesh processing

    Publication Year: 2004, Page(s):237 - 243
    Cited by:  Papers (2)
    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.
  • Colored pencil filter with custom colors

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

    This paper presents a new technique for automatically converting digital images into colored pencil drawings. In real colored pencil drawing, artists use different colors for different regions, and add pure colors directly onto paper to build the target color through optical blending. To support such effect, our technique extends the existing technique for reproducing color image with custom inks ... 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 (6)  |  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.
  • 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.
  • 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.
  • Controllable single-strip generation for triangulated surfaces

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

    In this paper, we introduce a method to represent a given triangular model using a single triangle strip. Since this problem is NP-complete, we break the limitation by splitting adjacent triangles when necessary. The common edge is split at the mid-point, and the newly formed triangles are coplanar with their parent triangles. Hence, the resulting geometry of the model is visually and topologicall... 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.
  • Personalised real-time idle motion synthesis

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

    In this paper, we propose an animation approach based on principal component analysis that allows generating two layers of subtle motions: small posture variations and personalised change of balance. Such a motion generator is needed in many cases when one attempts to create an animation sequence out of a set of existing clips. In nature there exists no motionless character, while in computer anim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discontinuous free form deformations

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

    Contemporary deformation tools let designers modify the geometry of deformed models. This approach can be restrictive if the designer wants to incorporate holes or gaps into a model while deforming it into a different shape. This work presents a variant of FFD that would let the designer incorporate isoparametric discontinuities into the deformation function. The input model is automatically split... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A versatile interactive 3D brush model

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

    We present a flexible modeling approach capable of realistically simulating many varieties of brushes commonly used in painting. Our geometric model of brush heads is a combination of subdivision surfaces and hundreds of individual bristles represented by thin polygonal strips. We exploit bristle-to-bristle coherence, simulating only a fraction of the bristles and using interpolation for the remai... 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.
  • 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.
  • Real-time voxelization for complex polygonal models

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

    In this paper, we present an efficient voxelization algorithm for complex polygonal models by exploiting newest programmable graphics hardware. We first convert the model into three discrete voxel spaces according to its surface orientation. The resultant voxels are encoded as 2D textures and stored in three intermediate sheet buffers called directional sheet buffers. These buffers are finally syn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CSG tree rendering for point-sampled objects

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

    This paper presents an algorithm for rendering of point-sampled CSG models. The approach works with arbitrary CSG trees of surfel models with arbitrary sampling densities. Edges and corners are rendered by reconstructing the involved surfaces separately. The reconstructed surfaces are clipped at intersections. This way, blurring at any magnification is avoided. As opposed to existing methods, whic... 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 (3)
    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.
  • Direct anisotropic quad-dominant remeshing

    Publication Year: 2004, Page(s):207 - 216
    Cited by:  Papers (15)  |  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.
  • A progressive refinement approach for image magnification

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

    The rapid growth in computer graphics and digital cameras has resulted in computer users being able to easily produce digital images. As a result, the need to display and print digital images has increased. Nowadays, high-resolution display and printing devices are available to users. Therefore, high-resolution images are needed in order to produce high quality displayed images and high quality pr... 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.
  • Segmentation of 3D meshes through spectral clustering

    Publication Year: 2004, Page(s):298 - 305
    Cited by:  Papers (23)
    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.
  • An improved N-bit to N-bit reversible Haar-like transform

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

    We introduce the piecewise-linear Haar (PLHaar) transform, a reversible n-bit to n-bit transform that is based on the Haar wavelet transform. PLHaar is continuous, while all current n-bit to n-bit methods are not, and is therefore uniquely usable with both lossy and lossless methods (e.g. image compression). PLHaar has both integer and continuous (i.e. non-discrete) forms. By keeping the coefficie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fitting subdivision surfaces to unorganized point data using SDM

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

    We study the reconstruction of smooth surfaces from point clouds. We use a new squared distance error term in optimization to fit a subdivision surface to a set of unorganized points, which defines a closed target surface of arbitrary topology. The resulting method is based on the framework of squared distance minimization (SDM) proposed by Pottmann et al. Specifically, with an initial subdivision... 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.