Results 141 to 150 of about 192 (184)
Neural Local Inter‐reflection Modeling for Garment Fold Rendering
Abstract Realistic garment rendering requires simulating complex multi‐bounce light paths within intricate fold geometries. In these regions, conventional path tracing is computationally expensive as light becomes trapped, necessitating high bounce counts for convergence.
Jooeun Son +4 more
wiley +1 more source
Progressively Projected Newton's Method
Abstract Newton's Method is widely used to find the solution of complex non‐linear simulation problems. To guarantee a descent direction, it is common practice to clamp the negative eigenvalues of each element Hessian prior to assembly—a strategy known as Projected Newton (PN)—but this perturbation often hinders convergence.
J. A. Fernández‐Fernández +2 more
wiley +1 more source
Survey on differential estimators for 3d point clouds
Abstract Recent advancements in 3D scanning technologies, including LiDAR and photogrammetry, have enabled the precise digital replication of real‐world objects. These methods are widely used in fields such as GIS, robotics, and cultural heritage. However, the point clouds generated by such scans are often noisy and unstructured, posing challenges for ...
Léo Arnal–Anger +4 more
wiley +1 more source
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley +1 more source
Hierarchical Optimization of the As‐Rigid‐As‐Possible Energy
Abstract The As‐Rigid‐As‐Possible (ARAP) energy [SA07] has become a versatile ingredient in various geometry processing and machine learning methods. The classic method for its minimization is a block coordinate descent, alternating between local rotation estimation and a global linear solve, which converges slowly for large problem instances.
Hendrik Meyer, Bernd Bickel, Marc Alexa
wiley +1 more source
Quantitative Metrics for Edge Bundling of Network Visualizations
Abstract Edge bundling is widely used for reducing visual clutter in large 2D network and trajectory visualizations. Various edge bundling methods have been proposed, each producing qualitatively distinct outputs for the same data; however, few quantitative metrics exist for systematic evaluation. In this paper, we propose a set of quantitative metrics
M. Wallinger +3 more
wiley +1 more source
Abstract Recent advances in AI enable the automatic generation of visualizations directly from textual prompts using agentic workflows. However, visualizations produced via one‐shot generative methods often suffer from insufficient quality, typically requiring a human in the loop to refine the outputs.
Roxana Bujack +4 more
wiley +1 more source
Class Angular Distortion Index for Dimensionality Reduction
Abstract Dimensionality reduction (DR) techniques are often characterized by whether they preserve global, high‐level structures in the data or local, neighborhood structures. This distinction matters in visualization: global methods can obscure clusters while local methods can over‐emphasize them.
Kaviru Gunaratne +2 more
wiley +1 more source
Number of Limit Cycles for Planar Systems with Invariant Algebraic Curves
Abstract For planar polynomials systems the existence of an invariant algebraic curve limits the number of limit cycles not contained in this curve. We present a general approach to prove non-existence of periodic orbits not contained in this given algebraic curve.
Armengol Gasull +2 more
exaly +4 more sources

