SearcharxivSearch

arXiv · 2608.28310

Transparency Rendering in Computer-Aided Design: Methodologies, Trade-offs, and Challenges

Abstract

This paper surveys the state of transparency rendering in Computer-Aided Design (CAD), with a focus on both practical deployment in industrial systems and the underlying algorithms. We first review current approaches to transparency rendering in CAD environments and outline application scenarios in which accurate and performant transparency is critical for design inspection, communication, and decision-making. We then analyze the trade-offs between approximate and exact transparency techniques, comparing their performance-quality balance on desktop and mobile platforms and discussing criteria for selecting appropriate methods. The survey further identifies the need for robust benchmarks, quality metrics, and evaluation methodologies tailored to CAD-specific visualization tasks. We examine techniques for emphasizing important interior components such as importance-driven transparency, silhouette-based methods, and related approaches to support effective spatial understanding in complex assemblies. Finally, we discuss the unique challenges of rendering transparent constructive solid geometry (CSG) objects, including robustness, correctness, and integration with modern rendering pipelines. Collectively, these contributions characterize current capabilities, systematize open problems, and outline future research directions for transparency rendering in CAD visualization.

Explore related subjects

Keep this discovery

BibTeXRIS

Grigoris Tsopouridis, Ioannis Fudos. 2026-08-28. Transparency Rendering in Computer-Aided Design: Methodologies, Trade-offs, and Challenges. https://doi.org/10.14733/cadaps.2027.133-151

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Adaptive Strategies for GR(1) Games

We consider two-player GR(1) games on graphs, where the system player Eve must satisfy \[ \Box\Diamond A_1\land\cdots\land\Box\Diamond A_m \;\implies\; \Box\Diamond G_1\land\cdots\land\Box\Diamond G_n \] against the environment player Adam. Here $A_1,\ldots,A_m$ are assumptions on the environment, $G_1,\ldots,G_n$ are guarantees the system must provide, and $\Box\Diamond S$ denotes ``always eventually $S$''. Traditional static strategies are overly conservative: they may actively violate assumptions to trivially satisfy the implication, or abandon all guarantees when any assumption is violated. Existing methods to prevent such behaviors incur doubly exponential blowup. We introduce an adaptive framework treating Adam as a non-adversarial agent with unknown objectives. Eve monitors which assumptions Adam actually meets and adapts her strategy at runtime to maximize satisfied guarantees. Central to our approach is a novel algorithm for monitoring liveness properties $\Box\Diamond S$, enabling Eve to maintain real-time likelihood estimates of which assumptions will be fulfilled. Eve pre-computes strategies optimal for different assumption subsets, deploying a probability distribution over them that dynamically adjusts based on monitor outputs. We prove that when assumptions are violated, Eve's randomized adaptive strategy converges asymptotically to the deterministic strategy maximizing guarantees. A prototype demonstrates effectiveness and superior computational performance compared to the state of the art.

cs.LO

Deep and Fast Approximate Order Independent Transparency

We present a machine learning approach for efficiently computing order independent transparency (OIT). Our method is fast, requires a small constant amount of memory (depends only on the screen resolution and not on the number of triangles or transparent layers), is more accurate as compared to previous approximate methods, works for every scene without setup and is portable to all platforms running even with commodity GPUs. Our method requires a rendering pass to extract all features that are subsequently used to predict the overall OIT pixel color with a pre-trained neural network. We provide a comparative experimental evaluation and shader source code of all methods for reproduction of the experiments.

cs.GR

Evaluating Constrained Iterative Refinement for Scalable Vector Graphics Generation with Off-the-Shelf VLMs

Scalable Vector Graphics (SVGs) power much of the modern visual ecosystem, yet state-of-the-art generative models focus almost entirely on rasterized images. We explore whether inference-time methods can unlock SVG generation capabilities in off-the-shelf vision-language models (VLMs). We systematically evaluate a constrained iterative refinement harness that combines visual feedback, structured editing, and constrained decoding to characterize the capabilities and limitations of current VLMs for SVG generation. Across multiple VLMs and generation settings, we find that constrained decoding improves compilation success rates, while iterative refinement reveals a deficit in visual reasoning and self-correction. Our results highlight both the promise and current limitations of using inference-time methods to adapt general-purpose VLMs for SVG generation.

cs.CV