Results 81 to 90 of about 7,016 (227)
Mesh Processing Non‐Meshes via Neural Displacement Fields
Computer Graphics Forum, EarlyView.Abstract Mesh processing pipelines are mature, but adapting them to newer non‐mesh surface representations—which enable fast rendering with compact file size—requires costly meshing or transmitting bulky meshes, negating their core benefits for streaming applications.
Yuta Noma +4 more
wiley +1 more source
Delaunay triangulation based image enhancement for echocardiography images
, 2009 A novel image enhancement approach for automatic echocardiography image processing is proposed. The main steps include undecimated wavelet based speckle noise reduction, edge detection, followed by a regional enhancement process that employs Delaunay ...
Ahanathapillai, V. +2 more
core
Formal study of plane Delaunay triangulation
, 2010 International audienceThis article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved.
Yves Bertot +3 more
core +2 more sources
EURASIP Journal on Advances in Signal Processing, 2002 We present one method for detecting defects on an inclined textured plane. This method uses a combination of a shape from texture (SFT) method with the Delaunay triangulation technique.
Boutté Laurent +2 more
doaj +1 more source
Graph‐based Black and White Stylization
Computer 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
Contouring Signed Distance Fields by Approximating Gradients
Computer Graphics Forum, EarlyView.Abstract Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives ...
M. Kohlbrenner, M. Alexa
wiley +1 more source
Simulation der internen Struktur von Zellen mittels Delaunay-Triangulation
, 2010 The goal of this project is to develop a framework for a cell that takes in consideration its internal structure, using an agent-based approach. In this framework, a cell was simulated as many sub-particles interacting to each other.
Grise, Graziela
core
Fingerprint Identification Using Delaunay Triangulation
, 1999 This paper presents a new indexing-based approach to fingerprint identification. Central to the proposed approach is the idea of associating a unique topological structure with the fingerprint minutiae using the Delaunay triangulation.
Bebis, George +5 more
core +1 more source
Identifying All Matches of a Rigid Object in an Input Image Using Visible Triangles
MathematicsIt has been suggested that for objects identifiable by their corners, every triangle formed by these corner points can serve as a reference for detecting other corner points.
Abdullah N. Arslan
doaj +1 more source
Terrain Synthesis and Authoring based on Iso‐Contours
Computer Graphics Forum, EarlyView.Abstract Digital terrains are central to realistic landscape depiction, yet authoring tools must balance perceptual realism with intuitive artistic control. We propose a compact vector‐based representation that models terrain as nested iso‐contours, inspired by geomorphology and cartography.
B. Huftier +5 more
wiley +1 more source