Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Computational Geometry

53 missions · 14 completed

Missions

Open39Completed14All53
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

A Faster FPTAS for Weighted Completion Time SchedulingResearch Paper

Minimizing the total weighted completion time on parallel identical machines, written Pm∥∑wjCjPm\|\sum w_jC_jPm∥∑wj​Cj​ in three-field notation, is one of the basic objectives of scheduling theory. For a single machine, Smith's rule (1956) solves it exactly by ordering jobs by non-increasing ratio wj/pjw_j/p_jwj​/pj​. Already for m=2m=2m=2 machines the problem is NP-hard (Bruno, Coffman and…

22 thms2 active usersReviewed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Geometric Bin Packing Beyond Convexity: Approximation Schemes without AugmentationResearch Paper

Geometric bin packing asks how many identical containers are needed to place a collection of objects without overlap. For polygonal objects, a bounding rectangle can discard useful free space around a concavity or inside a hole. The geometric distinction matters when the required answer is an actual placement in unit squares. The paper studies this problem…

15 thms2 active usersReviewed
Graph Theory·Captain: mikedeng1

A Sublinear Approximation Algorithm for Minimum Dilation Trees in the PlaneResearch Paper

A geometric spanning tree connects a finite set of points using straight segments between pairs of points. A route between two vertices follows the tree edges. Its length can exceed the direct Euclidean distance substantially, even when the tree has minimum total edge length. The minimum dilation tree problem asks for a tree that controls the worst such…

14 thms2 active usersReviewed
Theoretical Computer Science·Captain: Shuze Chen

Constant Approximation of Fréchet Distance in Near-Linear TimeResearch Paper

The Fréchet distance is a standard measure of similarity between curves. It is used for trajectory clustering, map construction and other tasks in spatio-temporal data mining (Alt 2009, cited by the paper as [Alt09]). Computing it exactly takes roughly quadratic time. Alt and Godau compute the continuous distance in O(nmlog⁡(nm))O(nm\log(nm))O(nmlog(nm)) time (1995), and Eiter and…

13 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Condorcet-Winning Sets and Peer Selection in Planar Metric ElectionsResearch Paper

A committee can satisfy a majority guarantee that no single candidate satisfies: no outside alternative is preferred to every committee member by more than half the electorate. Such a committee is a Condorcet-winning set, extending the single-candidate majority criterion studied in social choice. Elkind, Lang, and Saffidine introduced this set-valued…

21 thms2 active usersReviewed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: iris

Subset Sum in Almost-Linear TimeResearch Paper

Subset Sum asks, for integers 1≤a1,…,an≤Δ1\le a_1,\dots,a_n\le\Delta1≤a1​,…,an​≤Δ and a target ttt, whether some sub-collection sums to ttt. It is NP-hard, but solvable in pseudopolynomial time: Bellman's dynamic program takes O(n2Δ)O(n^2\Delta)O(n2Δ) time. The fine-grained question is how fast it can be solved in terms of nnn and Δ\DeltaΔ. Under the Strong Exponential Time Hypothesis no …

31 thms2 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: Shuze Chen

Dynamic Optimality to within O(log log log n)Research Paper

A binary search tree (BST) that restructures itself while serving lookups can adapt to the access pattern: frequently or recently accessed keys can be kept near the root. The dynamic optimality conjecture of Sleator and Tarjan (1985) asks whether a single online algorithm, splay trees in their formulation, is within a constant factor of the best offline…

23 thms2 active usersReviewed
CombinatoricsOperations ResearchOptimization·Captain: Shuze Chen

Stacking Stars: Minimum-Area Packing with and without RotationResearch Paper

Packing irregular shapes without overlap so as to use little material is a core problem of the cutting and nesting industries (sheet metal, textiles, wood). It has a large experimental and operations-research literature and several commercial and open-source systems. The CG:SHOP 2024 challenge (Fekete et al.) was a packing problem with nonconvex objects.…

25 thms2 active usersReviewed
🏆Completed
CombinatoricsDiscrete Geometry·Captain: mikedeng1

Strong Lower Bounds for Weak Epsilon-NetsResearch Paper

A collection of regions often has to be met by a small set of representative points. In discrete geometry this is a piercing problem: every region must contain at least one chosen point. When the regions are convex and each contains a prescribed fraction of a finite input set, the minimum required number of representatives is the weak epsilon-net problem.…

11 thms2 active usersReviewed
Machine LearningTheoretical Computer Science·Captain: iris

Learning Partition Trees for Nearest Neighbor SearchResearch Paper

Nearest neighbor search asks for a data structure on a dataset P⊂RdP\subset\mathbb R^dP⊂Rd of nnn points that, given a query qqq, returns a point of PPP closest to qqq. In high dimension, worst-case guarantees are known only with a multiplicative approximation to the distance (Andoni, Indyk 2006; Andoni, Laarhoven, Razenshteyn, Waingarten 2017). Practical systems are…

26 thms2 active usersReviewed
Operations ResearchTheoretical Computer Science·Captain: iris

Exact Euclidean TSP with Few Interior Points: A Square-Root ExponentResearch Paper

The Euclidean traveling salesman problem asks for a shortest closed tour through nnn given points of the plane, with costs the true Euclidean distances. It is NP-hard (Papadimitriou, 1977), and the subset dynamic program of Bellman and of Held and Karp (1962) solves it in time exponential in nnn. De Berg, Bodlaender, Kisfaludi-Bak and Kolay (SICOMP 2023) showed…

31 thms2 active usersReviewed
Graph TheoryTheoretical Computer Science·Captain: iris

Tight Bounds for (1+ϵ)(1+\epsilon)(1+ϵ)-Approximation for Minimum Spanning Trees in Doubling MetricsResearch Paper

A minimum spanning tree (MST) of a finite metric space (X,d)(X,d)(X,d) is a spanning tree of the complete graph on XXX of least total edge length. Computing it exactly from a distance oracle takes Θ(n2)\Theta(n^2)Θ(n2) distance queries even in metrics of constant doubling dimension (Andoni et al., 2014), so the question is how fast a (1+ϵ)(1+\epsilon)(1+ϵ)-approximate MST, a spanning tree…

54 thms2 active usersReviewed
Operations ResearchOptimizationTheoretical Computer Science·Captain: iris

Inapproximability of Euclidean Steiner TreeResearch Paper

The Euclidean Steiner Tree problem asks for a shortest network connecting nnn given points (terminals) in Rd\mathbb R^dRd, where additional Steiner points may be placed anywhere. It goes back to the Fermat–Torricelli problem, and it is NP-hard already in the plane (Garey, Graham and Johnson, 1977). In fixed dimension it admits a polynomial-time approximation…

30 thms2 active usersReviewed
Machine LearningTheoretical Computer Science·Captain: iris

Parallel Hierarchical Agglomerative Clustering in Low DimensionsResearch Paper

Hierarchical agglomerative clustering (HAC) is a greedy bottom-up clustering method available in SciPy, scikit-learn, fastcluster, R, MATLAB and other data science libraries. Its output, a dendrogram, can be cut at any level to obtain clusterings with any number of clusters, so users need not fix the number of clusters in advance. Different linkage functions…

26 thms2 active usersReviewed
Discrete GeometryOperations ResearchTheoretical Computer Science·Captain: iris

Constant Approximation Algorithms for Knapsack and Bin Packing for Convex PolygonsResearch Paper

Geometric knapsack asks which objects of a given family fit together in a limited region. It models cutting and nesting problems, where allowing rotations can improve material use. For axis-aligned rectangles, with or without quarter turns, constant-factor approximations have long been known. Under arbitrary rotations the problem was much less understood:…

46 thms2 active usersReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: iris

Weighted and Unweighted Online Connectivity Augmentation via Geometric Hitting SetResearch Paper

In the weighted connectivity augmentation problem (WCAP) one is given a kkk-edge-connected graph G=(V,E)G=(V,E)G=(V,E) and a set of candidate links L⊆(V2)L\subseteq\binom V2L⊆(2V​) with nonnegative costs, and buys a cheapest set of links whose addition makes the graph (k+1)(k+1)(k+1)-edge-connected. Its special cases, tree augmentation and cactus augmentation, are central problems of network…

56 thms2 active usersReviewed
🏆Completed
Discrete GeometryMachine Learning·Captain: mikedeng1

Geometric Deep Learning VI: Cotangent Weights Are Intrinsic, cot ∠uqv = (ℓ²_uq + ℓ²_vq − ℓ²_uv)/(4a_uvq) with Heron's Area a_uvqTextbook

Surfaces of three-dimensional objects are stored in computer graphics, vision and geometry processing as triangular meshes: finitely many points glued together by triangles. Geometric deep learning on such data needs a discretisation of the Laplace–Beltrami operator, because spectral filters, diffusion and many graph neural network layers on meshes are…

6 thms2 active usersReviewed
Linear algebraMachine Learning·Captain: mikedeng1

Turning Big Data into Tiny Data: Constant-Size Coresets for k-Means, PCA, and Projective Clustering I: The Rank-m SVD Truncation Plus Its Residual Preserves the Cost of Every j-Dimensional ShapeResearch Paper

Large data sets make clustering and subspace fitting expensive because a candidate solution must be evaluated against every input point. A dimensionality reduction replaces the data by a lower-rank matrix whose costs approximate those of the original input for an entire class of candidate solutions. Feldman, Schmidt, and Sohler study reductions that retain…

11 thms2 active usersReviewed
🏆Completed
CombinatoricsDiscrete Geometry·Captain: wurtle

A power saving for planar halving linesResearch Paper

Given nnn points in the plane with no three on a line, a halving line is a line through two of the points that leaves exactly half of the remaining points on each side. How many halving lines can an nnn-point set have? The question is the middle case of the kkk-set problem: count the kkk-element subsets that a line can cut off. It controls the complexity of levels…

4 thms2 active usersReviewed
Discrete Geometry·Captain: mikedeng1

Polylogarithmic Approximation for Packing Convex PolyhedraResearch Paper

Three-dimensional packing occurs when a collection of parts must share a container and its volume determines a cost. In additive manufacturing, the orientation of a part can be chosen before its position because orientation affects surface quality, support requirements, and production time. A mathematical version therefore keeps each shape's orientation…

15 thms1 active userReviewed
OptimizationProbabilityTheoretical Computer Science·Captain: Shuze Chen

Adversarially Robust Streaming Algorithms for (k,z)(k, z)(k,z)-ClusteringResearch Paper

kkk-Median and kkk-Means are among the most studied clustering problems. Both are cases of (k,z)(k,z)(k,z)-clustering in Rd\mathbb R^dRd: given a dataset PPP, find at most kkk centers that minimise the sum of the zzz-th powers of the Euclidean distances from the points to their nearest center. In the dynamic geometric stream model of Indyk (2004), the data arrive as insertions and…

11 thms1 active userReviewed
Machine LearningOperations ResearchTheoretical Computer Science·Captain: Shuze Chen

The Price of Capacities for Clustering CoresetsResearch Paper

A coreset compresses a large data set into a small weighted set on which a family of clustering queries can be evaluated with relative error ε\varepsilonε. Coresets for Euclidean (k,z)(k,z)(k,z)-clustering (kkk-median for z=1z=1z=1, kkk-means for z=2z=2z=2) are a standard tool for streaming, distributed and approximation algorithms, and their optimal size has been the subject of a…

22 thms1 active userReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: iris

Parameterized Tractability of Euclidean k-Steiner TreeResearch Paper

A Steiner tree connects a set of terminals by a network of minimum total length, possibly through auxiliary Steiner points. In the discrete Euclidean variant the Steiner points must be chosen from a finite candidate set given in the input, and in the kkk-Steiner variant at most kkk of them may be used, while the number of terminals is unrestricted. Exact…

32 thms1 active userReviewed
Markov ChainProbabilityTheoretical Computer Science·Captain: Shuze Chen

An FPRAS for Mixed VolumesResearch Paper

For compact convex sets K1,…,Km⊆RnK_1,\dots,K_m\subseteq\mathbb{R}^nK1​,…,Km​⊆Rn, Minkowski showed that the volume of a weighted Minkowski sum is a homogeneous polynomial of degree nnn in the weights,

27 thms1 active userReviewed
Discrete GeometryGraph Theory·Captain: iris

The Stretch Factor of Planar Delaunay Triangulations Is Nearly DeterminedResearch Paper

A Delaunay triangulation of a finite point set S⊂R2S\subset\mathbb R^2S⊂R2 is a triangulation in which the open circumdisk of every triangle contains no point of SSS. Its stretch factor is the worst ratio dD(u,v)/∥u−v∥d_D(u,v)/\|u-v\|dD​(u,v)/∥u−v∥ over pairs u≠vu\ne vu=v of SSS, where dD(u,v)d_D(u,v)dD​(u,v) is the length of a shortest path from uuu to vvv along the edges of DDD. A uniform bound ttt on this ratio makes…

32 thms1 active userReviewed
PreviousPage 2 of 3Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me