Results 51 to 60 of about 1,791 (171)
AUGURAL TERRITORIES: On the Prophetic Organizing of the Mid‐range
Abstract In this article I introduce the concept of augural territories to theorize the urbanism that emerged during pandemic lockdowns. I draw on ethnographic research in Madrid to examine how community‐based responses—including mutual aid networks, food pantries and neighbourhood associations—disrupted the spatial and temporal logics of territorial ...
Alberto Corsín Jiménez
wiley +1 more source
The Local Queue Number of Graphs with Bounded Treewidth
A queue layout of a graph G consists of a vertex ordering of G and a partition of the edges into so-called queues such that no two edges in the same queue nest, i.e., have their endpoints ordered in an ABBA-pattern.
Merker, Laura, Ueckerdt, Torsten
core
Fused Collapsing for Wide BVH Construction
Abstract We propose a novel approach for constructing wide bounding volume hierarchies on the GPU by integrating a simple bottom‐up collapsing procedure within an existing binary bottom‐up BVH builder. Our approach directly constructs a wide BVH without traversing a temporary binary BVH as done by previous approaches and achieves 1.4 – 1.6 × lower ...
Wilhem Barbier, Mathias Paulin
wiley +1 more source
Application of the 5S Method to Minimize Waiting Waste at the Yanti Shop, Brebes Regency
This research aims to overcome the problem of waste waiting, especially long queues, faced by Toko Yanti, a grocery store in Brebes Regency, Central Java Province.
Khulya Luthfia Nada +2 more
doaj +1 more source
NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields
Abstract Achieving realistic rendering of 3D scenes in real time using path tracing is challenging due to the high sample count required, with ray tracing as the bottleneck. Focusing on voxels as a geometry representation offers significant opportunities for optimizations, especially for tracing the rays, but also for computing the samples.
A. Ulschmid +4 more
wiley +1 more source
Abstract Graph drawing aesthetics have traditionally been optimized for human readers, leading to well‐established principles such as reducing edge crossings, enhancing symmetry, and minimizing bends. These criteria shape layout algorithms and define what “readability” means in network visualization.
Sara Di Bartolomeo +5 more
wiley +1 more source
Queue-based random-access algorithms: Fluid limits and stability issues [PDF]
We use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to match the optimal
Borst, S.C. +11 more
core +1 more source
Abstract Network visualization has traditionally relied on heuristic metrics, such as stress, under the assumption that optimizing them leads to aesthetic and informative layouts. However, no single metric consistently produces the most effective results.
X. Li, P. Zhang, X. Wang, H. Shen, Y. Hu
wiley +1 more source
CLusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source
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

