Results 171 to 180 of about 3,892,997 (230)

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

A novel ensemble-based genetic algorithm for enhanced feature selection in lung and pancreatic cancer diagnosis. [PDF]

Discov Oncol
Shabir S, Chishti MA.
europepmc   +1 more source

Fast Nodal Hessian Computation for Peridynamic Fracture Simulation

Computer Graphics Forum, EarlyView.
A fast, exact nodal Hessian computation for Non‐Ordinary State‐Based Peridynamics is introduced through analytical simplification and a warp‐centric GPU strategy. The method accelerates preconditioned solvers and Vertex Block Descent, enabling interactive fracture simulation with physical accuracy.
Yuxiong Qin, Qingfu Zhang, Zhongkai Zhang   +2 more
wiley   +1 more source

A novel hybrid control framework for frequency regulation in RES and EV-enriched power grids of Delhi power distribution utility. [PDF]

Sci Rep
Ranjan M, Shankar R, Gupta SK, Ranjan A, Rahman MA, Malik H, Jadoun VK.   +6 more
europepmc   +1 more source

Strictly Conservative Neural Distance Fields

Computer Graphics Forum, EarlyView.
Abstract We propose a first method to generate neural unsigned or signed distance fields (SDFs) that are guaranteed to be conservative with respect to a given 3D shape. This means the true distance is never overestimated and the zero‐level set is a bounding volume for the shape. The method makes use of neural network architectures that ensure Lipschitz
I. Ludwig, M. Campen
wiley   +1 more source

Robust multi-objective metaheuristic optimization of Cr(III) electrodeposition on 42CrMo4 steel for energy-efficient wear resistance. [PDF]

Sci Rep
Amar T, Selman D, Abdelhamid G.
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

An Outline of New Approach to Computation with Z-Numbers Based on the Concept of Lower Prevision. [PDF]

Entropy (Basel)
Aliev R, Huseynov O, Nuriyev A.
europepmc   +1 more source

Alternating Spatial‐Temporal Optimization for Continuous Collision Detection of Signed Distance Fields

Computer Graphics Forum, EarlyView.
Abstract We present a fast, robust method for continuous collision detection (CCD) directly between pairs of complex signed distance fields (SDFs). By casting CCD as an alternating spatio‐temporal optimization and driving a small set of smartly sampled surface points along SDF tangent spaces, our approach avoids dense sampling or triangle meshes ...
Rasmus Gabelgaard Nielsen, Kenny Erleben
wiley   +1 more source

Prototype-Based Classifiers and Vector Quantization on a Quantum Computer-Implementing Integer Arithmetic Oracles for Nearest Prototype Search. [PDF]

Entropy (Basel)
Engelsberger A, Pšeničkova M, Villmann T.   +2 more
europepmc   +1 more source