Results 181 to 190 of about 12,472 (260)

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

Techniques for integration within Bezier domains and approximation of circular arcs. [PDF]

MethodsX
Perumal L.
europepmc   +1 more source

Differentiable Randers‐Finsler Eikonal Solvers

Computer Graphics Forum, EarlyView.
Abstract Fast and differentiable solvers for anisotropic and asymmetric distance fields are a key primitive in geometry processing, enabling gradient‐based optimization over metrics, drift fields, and downstream objectives that depend on geodesic distances and geodesics.
Barak Gahtan, Jacob Shpund, Alex M. Bronstein   +2 more
wiley   +1 more source

Quantitative Assessment of Mesoscale Cellular Order and Organization in the Mouse Hippocampus. [PDF]

Hippocampus
Hein K, Romero-Limon H, Möckel C, Karasinsky A, Möllmert S, Kayser J, Zaccone A, Guck J, Toda T.   +8 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

How close have historical domestication and modern breeding come to ideotypes for yield? [PDF]

Plant Phenomics
Shan Y, Evers J, Sun B, Osborne CP.
europepmc   +1 more source

Circles of Confidence for Multi‐Label Geometry Completion

Computer Graphics Forum, EarlyView.
Abstract Inside–outside classification is widely used for geometry processing tasks such as surface reconstruction, geometry completion, and calculating signed distance fields. We introduce a new integral formulation of this problem, which assigns confidence scores that points are inside or outside, given incomplete boundary geometry.
Z. Wei, C. Hafner, A. Kalinov, P. Heiss‐Synak, C. Wojtan   +4 more
wiley   +1 more source

Comparative study of quadratic regression, Lasso, random forest, and multilayer perceptron for modeling optimal solid density in offset printing. [PDF]

PLoS One
Qiu B, Li L, Liu X, Sheng X, Jiang Y, Liu X, Ling YL.   +6 more
europepmc   +1 more source

A Target-Less Vision-Based Displacement Sensor Based on Image Convex Hull Optimization for Measuring the Dynamic Response of Building Structures. [PDF]

Sensors (Basel), 2016
Choi I, Kim J, Kim D.
europepmc   +1 more source

Progressive Convex Hull Simplification

Computer Graphics Forum, EarlyView.
Abstract Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We consider the problem of conservatively simplifying a convex hull to a specified number of half‐spaces ...
Alec Jacobson
wiley   +1 more source