Results 181 to 190 of about 539,388 (277)

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +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

Fractal hierarchy enables exponential scaling of topological boundary states. [PDF]

Nat Commun
Song L, Hu Z, Wang Z, Bongiovanni D, Tang L, Song D, Morandotti R, Xu J, Buljan H, Chen Z.   +9 more
europepmc   +1 more source

Phong‐Rodrigues Extrinsic Vector‐Field Processing

Computer Graphics Forum, EarlyView.
Abstract We introduce a new extrinsic discretization of tangent vector fields on triangle meshes that is continuous, with bounded derivatives that are continuous almost everywhere, supporting pointwise evaluation and integration of differential operators.
Hongyi Liu, Oded Stein, Amir Vaxman, Mirela Ben‐Chen, Misha Kazhdan   +4 more
wiley   +1 more source

Differentiation of site-specific symmetry breaking orders in Y_1-xPr_xBa₂Cu₃O_6+y. [PDF]

Nat Commun
Martinelli L, Rüdiger S, Biało I, Oppliger J, Igoa Saldaña F, von Zimmermann M, Weschke E, Arpaia R, Chang J.   +8 more
europepmc   +1 more source

A practical algorithm for weighted k‐hulls

Computer Graphics Forum, EarlyView.
Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley   +1 more source

A Decoupled Fractional-Order Kalman Filter for Accelerometer Tilt Angle Estimation. [PDF]

Sensors (Basel)
Wu N, Liu X, Han H, Wang J.
europepmc   +1 more source

Optimized and Aligned Anisotropic Monte Carlo Sampling Patterns

Computer Graphics Forum, EarlyView.
Abstract Path tracing uses Monte Carlo integration to solve the rendering equation by evaluating the integrand at random sampling points. The convergence rate of the error can be significantly improved by using correlated instead of random sampling, especially on smooth integrands.
Mirco Werner, Johannes Hanika, Carsten Dachsbacher   +2 more
wiley   +1 more source

Deconfounded-Debiased Estimation and Inference for High-Dimensional Mediation Analysis With Pervasive Hidden Confounders. [PDF]

Stat Med
Li Z, Pan L, Yu Y, Qin G, Fu B.
europepmc   +1 more source

CuRast: Cuda‐Based Software Rasterization for Billions of Triangles

Computer Graphics Forum, EarlyView.
Abstract This paper presents a CUDA‐based software rasterizer capable of rendering up to a billion unique triangles, or up to 4 billion instanced triangles, in real time at 60 fps on an RTX 5090. By specifically targeting dense, opaque meshes, our approach is able to outperform the native GPU rasterization pipeline in these scenarios.
M. Schütz, L. Lipp, E. Kristmann, M. Wimmer   +3 more
wiley   +1 more source