Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.34702

Faster Polyhedral Intersections in 3D

Joseph Donato·Daniel Shevitz·Rao Garimella
View original source ↗Read source document ↗Export metadata ↓

Abstract

The operation of intersecting two polyhedra, which can be reduced to clipping one polyhedron with a series of planes formed from another polyhedron, is central to intersection based mesh interpolation and material interface reconstruction. R3D is a robust library for such operation which implements the algorithm of Sugihara. In this paper, we present J3D, a new implementation of the clipping algorithm of Sugihara that provides substantial performance improvements over R3D.

Explore related subjects

cs.CE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph Donato, Daniel Shevitz, Rao Garimella. 2026-10-26. Faster Polyhedral Intersections in 3D. https://arxiv.org/abs/2610.34702

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Refined Thompson Learning for Adaptive Bandits: Power-Efficient Flexibility Scheduling Across Data Centers

The rapid growth of large-scale AI workloads in data centers has placed increasing pressure on power grids in recent years. Since power systems must continuously balance supply and demand, there is growing interest in leveraging data-center workload flexibility as a grid service. We propose a contextual restless multi-armed bandit (CRMAB) framework in which a grid operator requests load reductions without observing internal job-scheduling decisions. Under an index-ability guarantee, each data center or physical machine is modeled as a Markov decision process (MDP) over a cyclic virtual-machine (VM) job queue, with unknown rewards and transition dynamics that are learned online using Thompson sampling and Whittle-index policies. To improve learning under sparse and noisy observations, the framework augments an adaptive Thompson--Whittle (TW) policy with domain-informed transition priors and gated prior mixing. In baseline experiments, the best refined adaptive variant achieves 91.4\% of the oracle reward after 100 rounds and 96.8\% after 1,000 rounds. Across a 16-setting stress test spanning different state-space sizes and levels of contextual feature noise, the best refined variant consistently outperforms the original TW policy with high confidence while remaining competitive with EXP4. A graph-based prior further incorporates data-center hardware constraints, including operating frequency and computing-resource limits. Overall, our results demonstrate the economic potential of data-center flexibility as a grid service and highlight the importance of high-quality, open-source AI workload traces for developing and evaluating such services.

cs.CE↗
arXiv2026

A Topology-Aware Quantum-Classical Framework for Multi-Target Active Debris Removal using Gaussian Boson Sampling

The continued growth of orbital debris threatens the safety and sustainability of near-Earth space, making Active Debris Removal (ADR) an important mitigation strategy. Selecting $k$ targets from $N$ candidates yields a combinatorial search space of size $\binom{N}{k}$, making joint target selection and mission sequencing computationally demanding. We present a topology-aware quantum-classical framework integrating orbital mechanics, weighted orbital-transfer graphs, Gaussian Boson Sampling (GBS), and multi-objective evolutionary optimization. Seven target-prioritization strategies represent physical consequence, orbital persistence, conjunction risk, network centrality, community structure, inferred source families, and random selection. GBS generates candidate target subsets from the weighted graph, which are then evaluated using PyGMO-based evolutionary optimization to identify servicing sequences that jointly minimize total velocity increment ($Δv$) and mission duration, accounting for modeled timing, propulsion, and mass feasibility. We evaluate the framework across three benchmark environments, SOCRATES Minefield, Collision Cloud, and Random, with candidate-pool sizes $N\in\{15,18,22,25\}$ and target cardinalities $k\in\{3,5\}$. The experiments characterize how benchmark topology, prioritization strategy, and problem scale relate to sampling behavior and downstream mission performance. By separating candidate-subset generation from detailed trajectory optimization, the framework offers a topology-aware approach to focusing computational effort on a limited set of candidate ADR missions.

cs.CE↗
arXiv2026

Beyond Profit Rankings: Identifying, Understanding, and Evaluating Smart Money in Prediction Markets

Prediction markets have emerged as an important mechanism for aggregating information and trading beliefs about future events. The transparency of on-chain transactions has enabled investors to identify historically profitable wallets, commonly referred to as smart money, and replicate their trading activities through copy trading. However, despite the growing popularity of smart-money tracking, systematic research on these wallets' trading behavior, profitability persistence, and the economic feasibility of following their trades remains limited. To address this gap, we conduct a comprehensive empirical study of Polymarket, the most popular decentralized prediction market, by reconstructing wallet-level trading activities from on-chain transactions, position changes, market histories, and settlement outcomes. We first examine the distribution and persistence of historical profitability using statistical analysis and logistic regression, and further characterize heterogeneous trading strategies through multidimensional behavioral profiling and unsupervised clustering. Building on these findings, we develop an evidence-grounded multi-agent research framework that integrates wallet behavior, market conditions, and real-world information to generate interpretable and verifiable explanations of individual trades. Finally, we implement a real-time copy-trading system and evaluate its practical feasibility through order-book-aware paper trading and live on-chain execution. Our findings reveal substantial behavioral heterogeneity among historically profitable wallets and highlight the challenges of translating observed trading performance into replicable economic returns.

cs.CE↗