Results 121 to 130 of about 3,343 (219)

The Cartesian Gaussian additive noise model for directed network inference in omics data. [PDF]

BMC Med Res Methodol
Andrew B, Westhead DR, Cutillo L.
europepmc   +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, H. Schott, E. Galin, O. Argudo, A. Peytavie, E. Guérin   +5 more
wiley   +1 more source

Metric dimension of cycloparaphenylene and its derived molecular structures. [PDF]

Sci Rep
Prabhu S, Jeba DSR, Arulperumjothi M, Manuel P.   +3 more
europepmc   +1 more source

Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities

Computer Graphics Forum, EarlyView.
Abstract Estimating correspondences between deformed shape instances is a long‐standing problem in computer graphics; numerous applications, from texture transfer to statistical modelling, rely on recovering an accurate correspondence map. Many methods have thus been proposed to tackle this challenging problem from varying perspectives, depending on ...
A. Zhuravlev, L. Bastian, D. Cao, N. El Amrani, P. Roetzer, V. Ehm, R. Marin, H. Nishizawa, S. Morishima, C. Theobalt, N. Navab, D. Cremers, F. Bernard, Z. Lähner, V. Golyanik   +14 more
wiley   +1 more source

A New Lower Bound on the Minimum Density of Vertex Identifying Codes for the Infinite Hexagonal Grid

, 2011
The study of vertex identifying codes is grounded in graph theory and has applications in the design of multiprocessor networks. Roughly speaking, a vertex identifying code is a way of labeling the vertices of a graph. We are particularly interested in
Cukierman, Ariel J.
core  

Hierarchical Optimization of the As‐Rigid‐As‐Possible Energy

Computer Graphics Forum, EarlyView.
Abstract The As‐Rigid‐As‐Possible (ARAP) energy [SA07] has become a versatile ingredient in various geometry processing and machine learning methods. The classic method for its minimization is a block coordinate descent, alternating between local rotation estimation and a global linear solve, which converges slowly for large problem instances.
Hendrik Meyer, Bernd Bickel, Marc Alexa
wiley   +1 more source

Zagreb indices of hyper carbon nanotube graphs. [PDF]

Discov Nano
Shabbir A, Nadeem MF, Bashir Y, Husin MN, Muda Y.   +4 more
europepmc   +1 more source

NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields

Computer Graphics Forum, EarlyView.
Abstract Achieving realistic rendering of 3D scenes in real time using path tracing is challenging due to the high sample count required, with ray tracing as the bottleneck. Focusing on voxels as a geometry representation offers significant opportunities for optimizations, especially for tracing the rays, but also for computing the samples.
A. Ulschmid, M. Ott, J. Macho, M. Wimmer, S. Ohrhallinger   +4 more
wiley   +1 more source

CFD-driven neural network and SVM models for airfoil aerodynamic enhancement with bio-inspired riblets and plasma actuation. [PDF]

Sci Rep
Karthikeyan KV, Raju A, Jain J, Lekshmanan S, Rajan H.   +4 more
europepmc   +1 more source

Embedding Optimization of Layouts via Distortion Minimization

Computer Graphics Forum, EarlyView.
Abstract Given an embedding of a layout in the surface of a target mesh, we consider the problem of optimizing the embedding geometrically. Layout embeddings partition the surface into multiple disk‐like patches, making them particularly useful for parametrization and remeshing tasks, such as quad‐remeshing, since these problems can then be solved on ...
A. Heuschling, I. Lim, L. Kobbelt
wiley   +1 more source