🏛️ The Computational Geometry Crypt
cs.CG: Where Computational Geometry papers rest without their code.
628
Total Papers
578
No Code
1
Twilight
49
Has Code
7.8%
Survival Rate
R.I.P.
👻
Ghosted
R.I.P.
👻
Ghosted
Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures
R.I.P.
👻
Ghosted
The Power of Recursive Embeddings for $\ell_p$ Metrics
R.I.P.
👻
Ghosted
Efficient Greedy Discrete Subtrajectory Clustering
R.I.P.
👻
Ghosted
Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
R.I.P.
👻
Ghosted
Parameterized Geometric Graph Modification with Disk Scaling
R.I.P.
👻
Ghosted
Shortest Path Separators in Unit Disk Graphs
R.I.P.
👻
Ghosted
Structure and Independence in Hyperbolic Uniform Disk Graphs
R.I.P.
👻
Ghosted
On Line-Separable Weighted Unit-Disk Coverage and Related Problems
R.I.P.
👻
Ghosted
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
R.I.P.
👻
Ghosted
Maximum Polygon Packing: The CG:SHOP Challenge 2024
R.I.P.
👻
Ghosted
Dynamic Convex Hulls for Simple Paths
R.I.P.
👻
Ghosted
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable
R.I.P.
👻
Ghosted
Simple and Robust Dynamic Two-Dimensional Convex Hull
R.I.P.
👻
Ghosted
Sub-quadratic (1+\eps)-approximate Euclidean Spanners, with Applications
R.I.P.
👻
Ghosted
On the Line-Separable Unit-Disk Coverage and Related Problems
R.I.P.
👻
Ghosted
Dynamic Convex Hulls under Window-Sliding Updates
R.I.P.
👻
Ghosted
Minimum-Membership Geometric Set Cover, Revisited
R.I.P.
👻
Ghosted
On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete $k$-Center for Small $k$
R.I.P.
👻
Ghosted
Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions $d\ge 4$
R.I.P.
👻
Ghosted
Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023
R.I.P.
👻
Ghosted
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
R.I.P.
👻
Ghosted
Affine invariant triangulations
R.I.P.
👻
Ghosted