The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 37 items.
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- Sphere packings. II (Q1364136) (← links)
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (Q1380799) (← links)
- Piercing \(d\)-intervals (Q1387841) (← links)
- Note on the Erdős-Szekeres theorem (Q1387857) (← links)
- Straightening polygonal arcs and convexifying polygonal cycles (Q1423583) (← links)
- Some densest two-size disc packings in the plane (Q1423584) (← links)
- Testing homotopy for paths in the plane (Q1424318) (← links)
- On the generation of oriented matroids (Q1580742) (← links)
- Order on order types (Q1650795) (← links)
- On the circle covering theorem by A.W. Goodman and R.E. Goodman (Q1650801) (← links)
- On open and closed convex codes (Q1715995) (← links)
- On angles whose squared trigonometric functions are rational (Q1807607) (← links)
- Motion planning for multiple robots (Q1809508) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- Minimal-energy clusters of hard spheres (Q1900964) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- On Borsuk's conjecture for two-distance sets (Q2249469) (← links)
- Empty monochromatic simplices (Q2250050) (← links)
- Small simplicial complexes with prescribed torsion in homology (Q2316798) (← links)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
- Lossy gossip and composition of metrics (Q2351025) (← links)
- Topological persistence for circle-valued maps (Q2391833) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- Carathéodory's theorem in depth (Q2408186) (← links)
- Hyperbolicity vs. amenability for planar graphs (Q2408187) (← links)
- Universal completability, least eigenvalue frameworks, and vector colorings (Q2408207) (← links)
- Intrinsic volumes of polyhedral cones: a combinatorial perspective (Q2408212) (← links)
- Sylvester-Gallai theorems for complex numbers and quaternions (Q2492648) (← links)
- Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry (Q2571324) (← links)
- Computing cartograms with optimal complexity (Q5891266) (← links)
- Polychromatic colorings of plane graphs (Q5896961) (← links)
- A simple sampling lemma: Analysis and applications in geometric optimization (Q5939470) (← links)
- Distinct distances in the plane (Q5939473) (← links)
- Hard tiling problems with simple tiles (Q5955147) (← links)
- Bregman Voronoi diagrams (Q5962350) (← links)
