The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 50 items.
- On the exact constant in the quantitative Steinitz theorem in the plane (Q1338465) (← links)
- Helly-type theorems and generalized linear programming (Q1338955) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- Counting triangle crossings and halving planes (Q1338957) (← links)
- Computing a centerpoint of a finite planar set of points in linear time (Q1338958) (← links)
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains (Q1338959) (← links)
- Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- Objects that cannot be taken apart with two hands (Q1338963) (← links)
- Improved bounds on weak \(\varepsilon\)-nets for convex sets (Q1346122) (← links)
- Chiral polytopes from hyperbolic honeycombs (Q1346124) (← links)
- Better lower bounds on detecting affine and spherical degeneracies (Q1346125) (← links)
- Lattice-free polytopes and their diameter (Q1346126) (← links)
- An efficient algorithm for guard placement in polygons with holes (Q1346129) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space (Q1346132) (← links)
- Decomposition of convex figures into similar pieces (Q1346133) (← links)
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\) (Q1346134) (← links)
- On minimum and maximum spanning trees of linearly moving points (Q1346135) (← links)
- The Mayer-Vietoris and IC equations for convex polytopes (Q1346136) (← links)
- Problems of distance geometry and convex properties of quadratic maps (Q1346137) (← links)
- Lower-bound theorems for pseudomanifolds (Q1346138) (← links)
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\) (Q1346139) (← links)
- Successive minima, intrinsic volumes, and lattice determinants (Q1346140) (← links)
- Generation of oriented matroids --- a graph theoretical approach (Q1349279) (← links)
- Examples of \(\mathbb{Z}\)-acyclic and contractible vertex-homogeneous simplicial complexes (Q1349282) (← links)
- Circuit admissible triangulations of oriented matroids (Q1349283) (← links)
- The number of triangulations of the cyclic polytope \(C(n,n-4)\) (Q1349285) (← links)
- Infinitesimal Hopf algebras and the cd-index of polytopes (Q1349287) (← links)
- A combinatorial study of multiplexes and ordinary polytopes (Q1349291) (← links)
- Cutting dense point sets in half (Q1355189) (← links)
- Gaussian samples, regular simplices, and exchangeability (Q1355191) (← links)
- Lattice coverings and Gaussian measures of \(n\)-dimensional convex bodies (Q1355192) (← links)
- Inclusion-exclusion complexes for pseudodisk collections (Q1355193) (← links)
- A combinatorial property of convex sets (Q1355195) (← links)
- Monte Carlo approximation of form factors with error bounded a priori (Q1355196) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- On nearest-neighbor graphs (Q1355198) (← links)
- Inradii of simplices (Q1356073) (← links)
- Cell decompositions of the projective plane with Petrie polygons of constant length (Q1356075) (← links)
- On Helly's theorem: Algorithms and extensions (Q1356077) (← links)
- Stability of Blaschke's characterization of ellipsoids and Radon norms (Q1356079) (← links)
- A polyhedral approach for a constrained matching problem (Q1356081) (← links)
- Extremal properties of \(0/1\)-polytopes (Q1356085) (← links)
- Regular polytopes in ordinary space (Q1356086) (← links)
- Special issue dedicated to Jörg M. Wills on the occasion of his 60th birthday (Q1356087) (← links)
- A Helly-type theorem for unions of convex sets (Q1361809) (← links)
- Isogonal prismatoids (Q1361810) (← links)
- The \(d\)-step conjecture and Gaussian elimination (Q1361811) (← links)
- Weak \(\varepsilon\)-nets for points on a hypersphere (Q1361814) (← links)
