Results 81 to 90 of about 990,705 (257)
Constructive algebraic topology
Bulletin des Sciences Mathématiques, 2002 The classical ``computation'' methods in Algebraic Topology most often work by means of highly infinite objects and in fact +are_not+ constructive. Typical examples are shown to describe the nature of the problem. The Rubio-Sergeraert solution for Constructive Algebraic Topology is recalled.
Rubio, J., Sergeraert, F.
openaire +6 more sources
Quantitative Metrics for Edge Bundling of Network Visualizations
Computer Graphics Forum, EarlyView.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
Vector bundles and K-theory over topological algebras
, 1983 Functional analysis techniques, mainly pertaining to the theory of intinitedimensional representations, have been recently applied, mostly by Soviet mathematicians, to compute Hermitian K-groups related to the classification of quadratic forms with ...
A. Mallios
semanticscholar +1 more source
Uniqueness of the Fréchet space topology on certain topological algebras
Bulletin of the Australian Mathematical Society, 1971 It is well known that the complete norm topology on a Banach algebra is not unique in general, though semisimplicity is sufficient (but not necessary) for uniqueness.
R. Loy
semanticscholar +1 more source
Computer Graphics Forum, EarlyView.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
Computer Graphics Forum, EarlyView.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
Scalable Computation of Topological Abstractions for Scalar Data
Computer Graphics Forum, EarlyView.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
Survey on Visualization of Information Diffusion over Networks
Computer Graphics Forum, EarlyView.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
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
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 +3 more
wiley +1 more source