The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 50 items.
- Enumerating cube tilings (Q393746) (← links)
- Counterexamples of the conjecture on roots of Ehrhart polynomials (Q411392) (← links)
- Maximal f-vectors of Minkowski sums of large numbers of polytopes (Q411394) (← links)
- Smooth Fano polytopes whose Ehrhart polynomial has a root with large real part (Q411396) (← links)
- A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem (Q411397) (← links)
- Refined bounds on the number of connected components of sign conditions on a variety (Q411399) (← links)
- Scissors congruence, the golden ratio and volumes in hyperbolic 5-space (Q411400) (← links)
- A generalisation of Tverberg's theorem (Q411402) (← links)
- Non-rigidity of spherical inversive distance circle packings (Q411403) (← links)
- The shape of orthogonal cycles in three dimensions (Q411405) (← links)
- Moving out the edges of a lattice polygon (Q411406) (← links)
- A hyperplane inequality for measures of convex bodies in \(\mathbb R^{n }, \; n\leq 4\) (Q411408) (← links)
- Octants are cover-decomposable (Q411409) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids (Q411413) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Consistent digital line segments (Q420574) (← links)
- Optimal partition trees (Q420575) (← links)
- On the complexity of sets of free lines and line segments among balls in three dimensions (Q420577) (← links)
- Special issue: 26th annual symposium on computational geometry (SoCG 2010). Selected papers based on the presentations at the symposium, Snowbird, UT, USA, June 13--16, 2010. (Q422414) (← links)
- Lines avoiding balls in three dimensions revisited (Q443898) (← links)
- On the reconstruction of planar lattice-convex sets from the covariogram (Q443900) (← links)
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors (Q443903) (← links)
- A tight bound for the Delaunay triangulation of points on a polyhedron (Q443906) (← links)
- Approximating the Fréchet distance for realistic curves in near linear time (Q443909) (← links)
- Unions of fat convex polytopes have short skeletons (Q443910) (← links)
- Triangle contact representations and duality (Q443911) (← links)
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- The strong thirteen spheres problem (Q443916) (← links)
- On levels in arrangements of surfaces in three dimensions (Q443917) (← links)
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- Structure of the space of diametrically complete sets in a Minkowski space (Q452002) (← links)
- A new lower bound based on Gromov's method of selecting heavily covered points (Q452003) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- On the Orlicz Minkowski problem for polytopes (Q452005) (← links)
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations (Q452006) (← links)
- A triangulation of \(\mathbb CP ^{3}\) as symmetric cube of \(S ^{2}\) (Q452007) (← links)
- Contact numbers for congruent sphere packings in Euclidean 3-space (Q452008) (← links)
- Linear pencils of tropical plane curves (Q452009) (← links)
- An incidence theorem in higher dimensions (Q452010) (← links)
- Tilings of convex polygons with congruent triangles (Q452011) (← links)
- Some properties of Gromov-Hausdorff distances (Q452012) (← links)
- Smooth Fano polytopes with many vertices (Q464728) (← links)
- Generalization of Sabitov's theorem to polyhedra of arbitrary dimensions (Q464730) (← links)
- A discrete isoperimetric inequality on lattices (Q464731) (← links)
- On the geometry of cyclic lattices (Q464733) (← links)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- Divide and conquer roadmap for algebraic sets (Q464736) (← links)
