The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 50 items.
- Enumeration of lattice 3-polytopes by their number of lattice points (Q161308) (← links)
- Enumeration of lattice polytopes by their volume (Q161316) (← links)
- The Schläfli Fan (Q161345) (← links)
- The filling problem in the cube (Q262301) (← links)
- Discrete optimal transport: complexity, geometry and applications (Q262303) (← links)
- A \(t_k\) inequality for arrangements of pseudolines (Q262305) (← links)
- Two-orbit convex polytopes and tilings (Q262307) (← links)
- Gain-sparsity and symmetry-forced rigidity in the plane (Q262309) (← links)
- Combining persistent homology and invariance groups for shape comparison (Q262311) (← links)
- How to guard orthogonal polygons: diagonal graphs and vertex covers (Q262314) (← links)
- The edit distance for Reeb graphs of surfaces (Q262316) (← links)
- Gap probabilities and Betti numbers of a random intersection of quadrics (Q262317) (← links)
- Lower bounds on the length of monotone paths in arrangements (Q276089) (← links)
- About \(f\)-vectors of inscribed simplicial polytopes (Q282733) (← links)
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Interlacement of double curves of immersed spheres (Q282737) (← links)
- Generalizations of the Szemerédi-Trotter theorem (Q282741) (← links)
- Fractional and \(j\)-fold coloring of the plane (Q282745) (← links)
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph (Q282748) (← links)
- On the densest packing of polycylinders in any dimension (Q282750) (← links)
- Better bounds for planar sets avoiding unit distances (Q282753) (← links)
- Combinatorially two-orbit convex polytopes (Q282754) (← links)
- On the diameter of lattice polytopes (Q282757) (← links)
- Polycyclic movable 4-configurations are plentiful (Q282758) (← links)
- On the odd area of planar sets (Q282760) (← links)
- Packing convex bodies by cylinders (Q282761) (← links)
- A simple proof of the shallow packing lemma (Q282762) (← links)
- Quadrilateral meshes for PSLGs (Q306496) (← links)
- Nonobtuse triangulations of PSLGs (Q306497) (← links)
- Intrinsic volumes of random cubical complexes (Q306500) (← links)
- A Mihalisin-Klee theorem for fans (Q306503) (← links)
- On computability and triviality of well groups (Q306506) (← links)
- An improved upper bound for the Erdős-Szekeres conjecture (Q306509) (← links)
- Quantum jumps of normal polytopes (Q306512) (← links)
- Homometry and direct-sum decompositions of lattice-convex sets (Q306515) (← links)
- The maximum number of faces of the Minkowski sum of two convex polytopes (Q309640) (← links)
- Metric properties of semialgebraic mappings (Q309643) (← links)
- Apollonian ball packings and stacked polytopes (Q309645) (← links)
- Delaunay triangulations of closed Euclidean \(d\)-orbifolds (Q309648) (← links)
- Categorified Reeb graphs (Q309649) (← links)
- Irrational mixed decomposition and sharp fewnomial bounds for tropical polynomial systems (Q309651) (← links)
- Realising equivelar toroids of type \(\{4,4\}\) (Q309653) (← links)
- On the number of rich lines in high dimensional real vector spaces (Q309656) (← links)
- Erdős-Szekeres without induction (Q309659) (← links)
- Sub Rosa, a system of quasiperiodic rhombic substitution tilings with \(n\)-fold rotational symmetry (Q309662) (← links)
- Nerve complexes of circular arcs (Q312133) (← links)
- Invariants of random knots and links (Q312136) (← links)
- Computing the Fréchet distance with a retractable leash (Q312142) (← links)
- Bisector energy and few distinct distances (Q312146) (← links)
- Space exploration via proximity search (Q312150) (← links)
