The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 50 items.
- An improved bound on the number of unit area triangles (Q603876) (← links)
- The contact polytope of the Leech lattice (Q603877) (← links)
- Lines, circles, planes and spheres (Q603878) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- Slider-pinning rigidity: a Maxwell-Laman-type theorem (Q603881) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- The expected genus of a random chord diagram (Q629824) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- Dense fast random projections and Lean Walsh transforms (Q629831) (← links)
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs (Q629832) (← links)
- On the union of cylinders in three dimensions (Q629833) (← links)
- A Helly type theorem for abstract projective geometries (Q629834) (← links)
- Lines pinning lines (Q629835) (← links)
- Carathéodory-type theorems à la Bárány (Q629836) (← links)
- More colourful simplices (Q629837) (← links)
- Transversals in superdisjoint \(T(3)\)-families of translates (Q629838) (← links)
- Line transversals to translates of a convex body (Q629840) (← links)
- Tverberg-type theorems for intersecting by rays (Q629841) (← links)
- Piercing numbers for balanced and unbalanced families (Q629842) (← links)
- Tolerance in Helly-type theorems (Q629843) (← links)
- Pinning a line by balls or ovaloids in \(\mathbb R^{3}\) (Q629845) (← links)
- On the number of simple arrangements of five double pseudolines (Q629847) (← links)
- Hyperseparoids: a representation theorem (Q629848) (← links)
- The list-chromatic number of infinite graphs defined on Euclidean spaces (Q633199) (← links)
- On \(\gamma \)-vectors satisfying the Kruskal-Katona inequalities (Q633200) (← links)
- Dilation of Newton polytope and \(p\)-adic estimate (Q633201) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- New classes of counterexamples to Hendrickson's global rigidity conjecture (Q633205) (← links)
- The forest hiding problem (Q633206) (← links)
- Smooth Fano polytopes arising from finite partially ordered sets (Q633207) (← links)
- The \(f\)-vector of the descent polytope (Q633209) (← links)
- Random geometric complexes (Q633210) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- The ratio of the perimeter and the area of unions of copies of a fixed set (Q633213) (← links)
- Hardness results for homology localization (Q633215) (← links)
- The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
- Aperiodic tilings with one prototile and low complexity atlas matching rules (Q635747) (← links)
- Topological transversals to a family of convex sets (Q635748) (← links)
- On the number of ordinary circles determined by \(n\) points (Q635749) (← links)
- Coreduction homology algorithm for regular CW-complexes (Q635750) (← links)
- On Lebesgue measure of integral self-affine sets (Q635751) (← links)
- Lower bounds for cubical pseudomanifolds (Q635752) (← links)
- Representing a functional curve by curves with fewer peaks (Q635753) (← links)
- Rigidity of quasicrystallic and \(Z ^{\gamma }\)-circle patterns (Q635754) (← links)
- Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
- Optimally decomposing coverings with translates of a convex polygon (Q635757) (← links)
- Properties of axial diameters of a simplex (Q635760) (← links)
