Results 111 to 120 of about 3,343 (219)

Controllable Intrinsic Surface Pattern Generation Using Slime Mold Simulations

open access: yesComputer Graphics Forum, EarlyView.
Abstract Surface‐based pattern simulations have proven valuable for texture design and scientific visualization, but existing methods face several limitations. Most simulations either target a narrow range of pattern types (e.g. spots, branching) or support a broad range of patterns at the cost of time‐consuming parameter tuning.
Jeffrey Layton   +2 more
wiley   +1 more source

A new point creation scheme for uniform Delaunay triangulations

open access: yes, 2002
A new point creation scheme is presented for generating unstructured uniform size two-dimensional triangular meshes using the Delaunay triangulation method. The scheme is shown to be suitable for generating meshes with strict limits on element size, such
Muylle, J.   +5 more
core  

Volume Quantization with Flexible Singularities for Hexahedral Meshing

open access: yesComputer Graphics Forum, EarlyView.
Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley   +1 more source

Graph‐based Black and White Stylization

open access: yesComputer Graphics Forum, EarlyView.
Abstract Stippling is an art style forming images from large numbers of small dots. Computer graphics practitioners have proposed numerous algorithms for stippling and stippling variants over the years. In this paper, we propose a black and white image stylization technique in which the image is formed from heterogeneous black and white vector marks ...
Ali Sattari Javid   +2 more
wiley   +1 more source

A coin-moving game on graphs

open access: yes, 2019
We study a one-player game that is played on an undirected simple graph G=(V,E). Throughout the game, there will be coins sitting on some of the vertices of G (at most one per vertex).
Galliot, Florian
core  

LeafFit: Plant Assets Creation from 3D Gaussian Splatting

open access: yesComputer Graphics Forum, EarlyView.
Abstract We propose LeafFit, a pipeline that converts 3D Gaussian Splatting (3DGS) of individual plants into editable, instanced mesh assets. While 3DGS faithfully captures complex foliage, its high memory footprint and lack of mesh topology make it incompatible with traditional game production workflows. We address this by leveraging the repetition of
Chang Luo, Nobuyuki Umetani
wiley   +1 more source

Home - About - Disclaimer - Privacy