Results 181 to 190 of about 1,874,872 (323)

Parallel Vectors Extraction using Bézier Clipping

Computer Graphics Forum, EarlyView.
Abstract In this paper, we propose a novel local feature extraction algorithm for the parallel vectors (PV) operator. Our method is based on Bézier clipping, which is a bracketing‐based root finding method that is commonly‐used in computer‐aided geometric design.
Nico Daßler, Tobias Günther
wiley   +1 more source

Genetic modelling of the weekly weight of Japanese quails using orthogonal Legendre polynomials. [PDF]

Arch Anim Breed
Üçtepe A, Kominakis A.
europepmc   +1 more source

Structure of operator algebras for matrix orthogonal polynomials [PDF]

Ignacio Bono Parisi, Inés Pacharoni
openalex   +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

Wiener–Hopf factorizations and matrix-valued orthogonal polynomials [PDF]

Arno B. J. Kuijlaars, Mateusz Piorkowski
openalex   +2 more sources

High-accuracy pseudospectral scheme for fractional diffusion-wave problems based on cardinal functions. [PDF]

PLoS One
Saray BN, Juraev DA, Abdalla M, Efendiev R, Almalki Y, Ahdiaghdam S.   +5 more
europepmc   +1 more source

Tangent Blow‐Ups for Processing Non‐Manifold Geometry

Computer Graphics Forum, EarlyView.
Abstract Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners, self‐intersections, branching junctions, and other singularities, rendering standard methods ill‐defined at ...
Alice Petrov, Mohammad Sina Nabizadeh, Ana Dodik, Justin Solomon   +3 more
wiley   +1 more source

Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms. [PDF]

Philos Trans A Math Phys Eng Sci
Minenkova A, Mograby G, Zhan H.
europepmc   +1 more source

Bidiagonal matrix factorisations related to multiple orthogonal polynomials

Amílcar Branquinho, Juan E. F. Díaz, Ana Foulquié‐Moreno, Hélder Lima, Manuel Mañas   +4 more
openalex   +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