The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 50 items.
- Notes about the Carathéodory number (Q714989) (← links)
- Kadets-type theorems for partitions of a convex body (Q714990) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Affine properties of convex equal-area polygons (Q714992) (← links)
- On integral well-rounded lattices in the plane (Q714997) (← links)
- Determining a rotation of a tetrahedron from a projection (Q714999) (← links)
- The structure of cube tilings under symmetry conditions (Q715000) (← links)
- On the connectivity of visibility graphs (Q715001) (← links)
- The art gallery theorem for polyominoes (Q715003) (← links)
- A note on aperiodic Ammann tiles (Q715004) (← links)
- Blockers for simple Hamiltonian paths in convex geometric graphs of even order (Q724939) (← links)
- Ma-Schlenker \(c\)-octahedra in the 2-sphere (Q724940) (← links)
- Primitive zonotopes (Q724942) (← links)
- Well-distributed great circles on \(\mathbb S^2\) (Q724943) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- Simion's type \(B\) associahedron is a pulling triangulation of the Legendre polytope (Q724945) (← links)
- On the reverse Loomis-Whitney inequality (Q724946) (← links)
- Lattice points in algebraic cross-polytopes and simplices (Q724947) (← links)
- Reptilings and space-filling curves for acute triangles (Q724950) (← links)
- Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation (Q724951) (← links)
- On sets defining few ordinary planes (Q724952) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- On the shadow simplex method for curved polyhedra (Q728496) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- Sylvester-Gallai for arrangements of subspaces (Q728498) (← links)
- A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes (Q728499) (← links)
- Star unfolding from a geodesic curve (Q728501) (← links)
- Historical overview of the Kepler conjecture (Q734995) (← links)
- A formulation of the Kepler conjecture (Q734997) (← links)
- Sphere packings. III: Extremal cases (Q734998) (← links)
- Sphere packings. IV: Detailed bounds (Q734999) (← links)
- Sphere packings. V: Pentahedral prisms (Q735000) (← links)
- Sphere packings. VI: Tame graphs and linear programs (Q735001) (← links)
- Realizability of polytopes as a low rank matrix completion problem (Q741602) (← links)
- Non-embeddability of geometric lattices and buildings (Q741603) (← links)
- Hyperbolic polynomials and generalized Clifford algebras (Q741604) (← links)
- Circumcenter of mass and generalized Euler line (Q741605) (← links)
- Some remarks on the circumcenter of mass (Q741606) (← links)
- Diameter graphs in \({\mathbb R}^4\) (Q741607) (← links)
- Duality properties of strong isoperimetric inequalities on a planar graph and combinatorial curvatures (Q741608) (← links)
- Convex polygons are self-coverable (Q741609) (← links)
- Arrangements of pseudocircles and circles (Q741610) (← links)
- From Steiner formulas for cones to concentration of intrinsic volumes (Q741611) (← links)
- Upper bounds on packing density for circular cylinders with high aspect ratio (Q741612) (← links)
- Covering nearly surface-embedded graphs with a fixed number of balls (Q741614) (← links)
- The inradius of a hyperbolic truncated \(n\)-simplex (Q741615) (← links)
- Characterizing the universal rigidity of generic frameworks (Q741616) (← links)
- On Gromov's method of selecting heavily covered points (Q742816) (← links)
