23 items across game development
23 results
arXiv cs.GR details S4R, a scale-continuation method that repairs rigid-body interpenetration in large procedural scenes. It shrinks bodies to a collision-free state, then restores full size through shallow convex QP …
A new non-uniform B-spline optimization method targets swept-surface generation with fewer control points and tighter error bounds. For CAD and content pipelines that rely on clean parametric surfaces, the practical …
Researchers have published a new offset-mesh generation method that preserves sharp features and boundaries while staying efficient enough for practical geometry workflows. The work targets a long-standing pain point in …
NeuSOGA turns geometric observations into editable symbolic math, aiming to replace opaque latent encodings with explicit representations. The framework combines topology-guided discovery, Segment Anything-based perception, multi-scale abstraction, and Implicit Area …
ACM Graphics has published an erratum for a precision-controlled surface-surface intersection algorithm for NURBS, a niche but important topic for high-end geometry work. For teams building CAD-like tools, procedural modeling, …
A correction has been issued for a 2026 ACM Transactions on Graphics paper on NURBS surface intersection, specifically the version covering small loops and tangent intersections. For graphics teams working …
A graphics paper reframes convex-scene rendering as an information problem: preserve the apartness relations between object groups, not just pixels. The authors report 99.9% bit accuracy recovering scenes from the …
A new procedural geometry library focuses on generating smooth, analysis-ready human airway meshes from compact YAML specs, which is a big deal if you care about reproducible simulation assets. The …
A 100,000-sample CAD dataset now ships with executable Python programs, validated feature histories, STEP output, point clouds, and renderings. For tools and technical teams, the interesting part is that each …
A hybrid deep-learning plus iterative-optimization pipeline reconstructs patient-specific pelvic organ meshes from MRI with better geometric fidelity than prior ML-only approaches. The paper reports lower Chamfer Distance, higher Dice scores, …
A neural surrogate can now approximate geometric mapping problems without being tied to a fixed grid, which is interesting for anyone wrestling with expensive field-based simulation. The paper targets tasks …
A new AI pipeline can turn point clouds into physically buildable brick assemblies instead of just plausible-looking shapes. BrickAnything adds structure-aware tree tokenization plus validity checks, rollback, and preference-based alignment …
AMD and Samsung are collaborating on a new Vulkan extension for Dense Geometry Format (DGF), which promises to significantly reduce geometry size and improve memory efficiency for ray-traced real-time 3D …
The extension of the Sierpinski arrowhead curve to higher dimensions presents exciting possibilities for graphics programmers and designers. This research introduces reproduction rules for visualizing complex geometric patterns, which can …
A new method for parameterizing genus-0 closed surfaces using ellipsoidal density-equalizing maps offers significant improvements for graphics programmers. This approach minimizes geometric distortion compared to spherical mappings, enhancing surface remeshing …
The new GENIE framework introduces a significant advancement in editing Implicit Neural Representations (INRs) by allowing closed-form geometry updates. This innovation enables graphics programmers and artists to modify 3D shapes …
A new triangulation framework enhances how developers discretize image-derived domains for PDEs. By embedding boundaries into a triangular grid, it improves geometric fidelity and reduces sliver elements, making it particularly …
A novel geometric data representation using diffusion models is set to transform 3D modeling. This approach addresses limitations in existing neural representations, particularly for thin structures and non-watertight geometries, making …
The article introduces a greedy algorithm for extracting clean geometric shapes from dense grid data, significantly simplifying rendering and collision tasks for developers. This technique is particularly beneficial for graphics …
Greedy rectangle merging offers a streamlined method for simplifying dense binary grids into fewer axis-aligned rectangles. This technique is particularly beneficial for graphics programmers and designers, as it reduces the …
Page 1 of 2
With your permission, GameDev.net uses analytics cookies to understand how people use the platform. You can accept analytics or continue with necessary cookies only. Learn more
