Results 71 to 80 of about 2,869,100 (185)
Scalable Computation of Topological Abstractions for Scalar Data
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
Efficient Unitary Designs with a System-Size Independent Number of Non-Clifford Gates. [PDF]
Haferkamp J +5 more
europepmc +1 more source
Survey on Visualization of Information Diffusion over Networks
Abstract Information Diffusion (ID) describes how a value (e.g., a pathogen, a rumor, a packet) spreads through an underlying “medium” network of elements (e.g., a social or computer network). Understanding the information diffusion process is essential to predicting trends, controlling misinformation, and enhancing decision‐making as well as ...
T. Baumgartl +8 more
wiley +1 more source
Fast Nodal Hessian Computation for Peridynamic Fracture Simulation
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 +2 more
wiley +1 more source
Phong‐Rodrigues Extrinsic Vector‐Field Processing
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 +4 more
wiley +1 more source
Progressive Convex Hull Simplification
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
Tangent Blow‐Ups for Processing Non‐Manifold Geometry
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 +3 more
wiley +1 more source
Super Quantum Airy Structures. [PDF]
Bouchard V +6 more
europepmc +1 more source
Random‐key optimization for 2D irregular packing with reusable area evaluation
Abstract The diverse constraints of industrial applications lead to variants of two‐dimensional (2D) irregular packing problems that require tailored solution methods. This paper addresses a real‐world industrial challenge by proposing a new problem definition, the maximum reusable contiguous area problem (MRCAP), and a novel metric, the maximum ...
Felipe S. C. Roberto +5 more
wiley +1 more source
Privatization Under Political Ties
ABSTRACT I study a product differentiation model with endogenous entry where a politically connected public firm competes with a private one. Consumers are heterogeneous in their willingness to pay. I argue that—because of political ties—the public firm may mimic the preferences of the consumer with the median willingness to pay.
Matteo Broso
wiley +1 more source

