📚 New in arXiv cs.CG: Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions

📚 New in arXiv cs.CG: Higher-order Persistence Diagrams

📚 New in arXiv cs.CG: Charting the Diameter Computation Landscape on Intersection Graphs in the Plane

📚 New in arXiv cs.CG: The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems

📚 New in arXiv cs.CG: FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering

📚 New in arXiv cs.CG: A discrete wedge product on general polygonal meshes

📚 New in arXiv cs.CG: Instance and Universally Optimal Bounds for Imprecise Pareto Fronts

📚 New in arXiv cs.CG: Touring a Sequence of Orthogonal Polygons

📚 New in arXiv cs.CG: Coordinated Motion Planning is FPT on Discretized Simple Polygons

📚 New in arXiv cs.CG: A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D

📚 New in arXiv cs.CG: Scalable GPU Construction of 3D Voronoi and Power Diagrams

📚 New in arXiv cs.CG: Planar morphometry via functional shape data analysis and quasi-conformal mappings

📚 New in arXiv cs.CG: Geometry-Aware Simplicial Message Passing

📚 New in arXiv cs.CG: Structure and generation of crossing-critical graphs

📚 New in arXiv cs.CG: The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring

📚 New in arXiv cs.CG: Optimally Covering Large Triangles with Homothetic Unit Triangles

📚 New in arXiv cs.CG: On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces

📚 New in arXiv cs.CG: A Unified FPT Framework for Crossing Number Problems

📚 New in arXiv cs.CG: Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness

📚 New in arXiv cs.CG: Visibility Queries in Simple Polygons

📚 New in arXiv cs.CG: Computing Planar Convex Hulls with a Promise

📚 New in arXiv cs.CG: Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams

📚 New in arXiv cs.CG: Spherical Geometrical Bases of Spherical Origami

📚 New in arXiv cs.CG: Witness Set: A Visibility Problem in $NP\cap XP$

📚 New in arXiv cs.CG: A greedy maximal sweepline algorithm for a Jordan curve

📚 New in arXiv cs.CG: Manifold k-NN: Accelerated k-NN Queries for Manifold Point Clouds

📚 New in arXiv cs.CG: Faster Mixing for Triangulations via Transport Flows

📚 New in arXiv cs.CG: Implicit Minimal Surfaces for Bijective Correspondences

📚 New in arXiv cs.CG: Self-Supervised Learning for Multimodal Non-Rigid 3D Shape Matching

📚 New in arXiv cs.CG: Revisiting Map Relations for Unsupervised Non-Rigid Shape Matching

📚 New in arXiv cs.CG: Strips as Tokens: Artist Mesh Generation with Native UV Segmentation

📚 New in arXiv cs.CG: Upward-Planar Drawings with Bounded Span

📚 New in arXiv cs.CG: Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams

📚 New in arXiv cs.CG: Counting All Lattice Rectangles in the Square Grid in Near-Linear Time

📚 New in arXiv cs.CG: Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases

📚 New in arXiv cs.CG: Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming

📚 New in arXiv cs.CG: Conic locus of inversive Poncelet circumcenter and two points of invariant circle power

📚 New in arXiv cs.CG: Calibrated Persistent Homology Tests for High-dimensional Collapse Detection

📚 New in arXiv cs.CG: The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem

📚 New in arXiv cs.CG: A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon

📚 New in arXiv cs.CG: Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases

📚 New in arXiv cs.CG: Conic locus of inversive Poncelet circumcenter and two points of invariant circle power

📚 New in arXiv cs.CG: A stellated tetrahedron that is probably not Rupert

📚 New in arXiv cs.CG: Small Independent Sets versus Small Separator in Geometric Intersection Graphs

📚 New in arXiv cs.CG: An Overview of Minimum Convex Cover and Maximum Hidden Set

📚 New in arXiv cs.CG: The Walk-Length Filtration for Persistent Homology on Weighted Directed Graphs

📚 New in arXiv cs.CG: A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs

📚 New in arXiv cs.CG: Point Group Symmetry of Polyhedral Diagrams in Graphic Statics