@cs-cg-arxiv.bsky.social
📤 20
📥 0
📝 358
youtu.be/t5kdk8KkAwI
loading . . .
Sergio Cabello: Delaunay Triangulations with Predictions
YouTube video by Computational Geometry
https://youtu.be/t5kdk8KkAwI
about 5 hours ago
0
0
1
www.youtube.com/watch?v=h5l7...
loading . . .
Satyan L. Devadoss: Unfolding Polyhedra and Polytopes
YouTube video by Computational Geometry
https://www.youtube.com/watch?v=h5l7Kg0CDYM
about 5 hours ago
0
0
1
📚 New in arXiv cs.CG: Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions
loading . . .
Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.09234
about 9 hours ago
0
0
0
📚 New in arXiv cs.CG: Higher-order Persistence Diagrams
loading . . .
Higher-order Persistence Diagrams
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.09866
about 9 hours ago
0
0
0
📚 New in arXiv cs.CG: Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
loading . . .
Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.10692
about 9 hours ago
0
0
0
📚 New in arXiv cs.CG: The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
loading . . .
The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.09464
about 9 hours ago
0
0
0
📚 New in arXiv cs.CG: FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
loading . . .
FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.10895
about 9 hours ago
0
0
0
📚 New in arXiv cs.CG: A discrete wedge product on general polygonal meshes
loading . . .
A discrete wedge product on general polygonal meshes
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2504.14275
about 9 hours ago
0
0
0
📚 New in arXiv cs.CG: Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
loading . . .
Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.07523
1 day ago
0
0
0
📚 New in arXiv cs.CG: Touring a Sequence of Orthogonal Polygons
loading . . .
Touring a Sequence of Orthogonal Polygons
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.07882
1 day ago
0
0
0
📚 New in arXiv cs.CG: Coordinated Motion Planning is FPT on Discretized Simple Polygons
loading . . .
Coordinated Motion Planning is FPT on Discretized Simple Polygons
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.07570
1 day ago
0
0
0
📚 New in arXiv cs.CG: A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
loading . . .
A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.05917
4 days ago
0
0
0
📚 New in arXiv cs.CG: Scalable GPU Construction of 3D Voronoi and Power Diagrams
loading . . .
Scalable GPU Construction of 3D Voronoi and Power Diagrams
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.06408
4 days ago
0
0
0
📚 New in arXiv cs.CG: Planar morphometry via functional shape data analysis and quasi-conformal mappings
loading . . .
Planar morphometry via functional shape data analysis and quasi-conformal mappings
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.05778
4 days ago
0
0
0
📚 New in arXiv cs.CG: Geometry-Aware Simplicial Message Passing
loading . . .
Geometry-Aware Simplicial Message Passing
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.06061
4 days ago
0
0
0
📚 New in arXiv cs.CG: Structure and generation of crossing-critical graphs
loading . . .
Structure and generation of crossing-critical graphs
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/1803.01931
4 days ago
0
0
0
📚 New in arXiv cs.CG: The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
loading . . .
The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2603.24880
4 days ago
0
0
0
📚 New in arXiv cs.CG: Optimally Covering Large Triangles with Homothetic Unit Triangles
loading . . .
Optimally Covering Large Triangles with Homothetic Unit Triangles
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.04111
5 days ago
0
0
0
📚 New in arXiv cs.CG: On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
loading . . .
On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.04715
5 days ago
0
0
0
📚 New in arXiv cs.CG: A Unified FPT Framework for Crossing Number Problems
loading . . .
A Unified FPT Framework for Crossing Number Problems
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2410.00206
5 days ago
0
0
0
📚 New in arXiv cs.CG: Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
loading . . .
Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2508.00091
5 days ago
0
0
0
📚 New in arXiv cs.CG: Visibility Queries in Simple Polygons
loading . . .
Visibility Queries in Simple Polygons
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.03334
6 days ago
0
0
0
📚 New in arXiv cs.CG: Computing Planar Convex Hulls with a Promise
loading . . .
Computing Planar Convex Hulls with a Promise
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.03904
6 days ago
0
0
0
📚 New in arXiv cs.CG: Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
loading . . .
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.00743
6 days ago
0
0
0
📚 New in arXiv cs.CG: Spherical Geometrical Bases of Spherical Origami
loading . . .
Spherical Geometrical Bases of Spherical Origami
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.01184
7 days ago
0
0
0
📚 New in arXiv cs.CG: Witness Set: A Visibility Problem in $NP\cap XP$
loading . . .
Witness Set: A Visibility Problem in $NP\cap XP$
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.01592
7 days ago
0
0
0
📚 New in arXiv cs.CG: A greedy maximal sweepline algorithm for a Jordan curve
loading . . .
A greedy maximal sweepline algorithm for a Jordan curve
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.01861
7 days ago
0
0
0
📚 New in arXiv cs.CG: Manifold k-NN: Accelerated k-NN Queries for Manifold Point Clouds
loading . . .
Manifold k-NN: Accelerated k-NN Queries for Manifold Point Clouds
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.02224
7 days ago
0
0
0
📚 New in arXiv cs.CG: Faster Mixing for Triangulations via Transport Flows
loading . . .
Faster Mixing for Triangulations via Transport Flows
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.02067
7 days ago
0
0
0
📚 New in arXiv cs.CG: Implicit Minimal Surfaces for Bijective Correspondences
loading . . .
Implicit Minimal Surfaces for Bijective Correspondences
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.02770
7 days ago
0
0
0
📚 New in arXiv cs.CG: Self-Supervised Learning for Multimodal Non-Rigid 3D Shape Matching
loading . . .
Self-Supervised Learning for Multimodal Non-Rigid 3D Shape Matching
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2303.10971
7 days ago
0
0
0
📚 New in arXiv cs.CG: Revisiting Map Relations for Unsupervised Non-Rigid Shape Matching
loading . . .
Revisiting Map Relations for Unsupervised Non-Rigid Shape Matching
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2310.11420
7 days ago
0
0
0
📚 New in arXiv cs.CG: Strips as Tokens: Artist Mesh Generation with Native UV Segmentation
loading . . .
Strips as Tokens: Artist Mesh Generation with Native UV Segmentation
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.09132
7 days ago
0
0
0
📚 New in arXiv cs.CG: Upward-Planar Drawings with Bounded Span
loading . . .
Upward-Planar Drawings with Bounded Span
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.00603
8 days ago
0
0
0
📚 New in arXiv cs.CG: Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
loading . . .
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2605.00743
8 days ago
0
0
0
📚 New in arXiv cs.CG: Counting All Lattice Rectangles in the Square Grid in Near-Linear Time
loading . . .
Counting All Lattice Rectangles in the Square Grid in Near-Linear Time
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.22456
8 days ago
0
0
0
📚 New in arXiv cs.CG: Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
loading . . .
Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.26929
8 days ago
0
0
0
📚 New in arXiv cs.CG: Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
loading . . .
Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2511.14244
11 days ago
0
0
0
📚 New in arXiv cs.CG: Conic locus of inversive Poncelet circumcenter and two points of invariant circle power
loading . . .
Conic locus of inversive Poncelet circumcenter and two points of invariant circle power
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.26035
11 days ago
0
0
0
📚 New in arXiv cs.CG: Calibrated Persistent Homology Tests for High-dimensional Collapse Detection
loading . . .
Calibrated Persistent Homology Tests for High-dimensional Collapse Detection
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.26068
12 days ago
0
0
0
📚 New in arXiv cs.CG: The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
loading . . .
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.26749
12 days ago
0
0
0
📚 New in arXiv cs.CG: A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon
loading . . .
A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.26812
12 days ago
0
0
0
📚 New in arXiv cs.CG: Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
loading . . .
Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.26929
12 days ago
0
0
0
📚 New in arXiv cs.CG: Conic locus of inversive Poncelet circumcenter and two points of invariant circle power
loading . . .
Conic locus of inversive Poncelet circumcenter and two points of invariant circle power
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.26035
12 days ago
0
0
0
📚 New in arXiv cs.CG: A stellated tetrahedron that is probably not Rupert
loading . . .
A stellated tetrahedron that is probably not Rupert
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.26531
12 days ago
0
0
0
📚 New in arXiv cs.CG: Small Independent Sets versus Small Separator in Geometric Intersection Graphs
loading . . .
Small Independent Sets versus Small Separator in Geometric Intersection Graphs
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.26533
12 days ago
0
0
0
📚 New in arXiv cs.CG: An Overview of Minimum Convex Cover and Maximum Hidden Set
loading . . .
An Overview of Minimum Convex Cover and Maximum Hidden Set
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2403.01354
12 days ago
0
0
0
📚 New in arXiv cs.CG: The Walk-Length Filtration for Persistent Homology on Weighted Directed Graphs
loading . . .
The Walk-Length Filtration for Persistent Homology on Weighted Directed Graphs
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2506.22263
12 days ago
0
0
0
📚 New in arXiv cs.CG: A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
loading . . .
A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.25397
13 days ago
0
0
0
📚 New in arXiv cs.CG: Point Group Symmetry of Polyhedral Diagrams in Graphic Statics
loading . . .
Point Group Symmetry of Polyhedral Diagrams in Graphic Statics
New paper in cs.CG (Computational Geometry)
https://arxiv.org/abs/2604.25695
13 days ago
0
0
0
Load more
feeds!
log in