The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 50 items.
- Persistent cohomology and circular coordinates (Q540443) (← links)
- Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach (Q540445) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Cache-oblivious range reporting with optimal queries requires superlinear space (Q540448) (← links)
- A proof of the molecular conjecture (Q540449) (← links)
- The Banach-Mazur distance to the cube in low dimensions (Q542382) (← links)
- A celtic framework for knots and links (Q542383) (← links)
- Tiling lattices with sublattices. I (Q542385) (← links)
- Extremal Betti numbers of Vietoris-Rips complexes (Q542387) (← links)
- Spherical distribution of 5 points with maximal distance sum (Q542388) (← links)
- Prodsimplicial-neighborly polytopes (Q542391) (← links)
- Bounded direction-length frameworks (Q542392) (← links)
- Necessary conditions for the global rigidity of direction-length frameworks (Q542393) (← links)
- Equivalence of self-similar and pseudo-self-similar tiling spaces in \(\mathbb R^{2}\) (Q542395) (← links)
- A polynomial number of random points does not determine the volume of a convex body (Q542396) (← links)
- Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram (Q542397) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- On the contact dimensions of graphs (Q579284) (← links)
- Tiling the torus and other space forms (Q581420) (← links)
- A geometric realization without self-intersections does exist for Dyck's regular map (Q581842) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- Estimates for the minimal width of polytopes inscribed in convex bodies (Q583611) (← links)
- Delaunay graphs are almost as good as complete graphs (Q584279) (← links)
- Indecomposable coverings with concave polygons (Q603839) (← links)
- The least-perimeter partition of a sphere into four equal areas (Q603841) (← links)
- Three-dimensional classical groups acting on polytopes (Q603843) (← links)
- Irreducible Apollonian configurations and packings (Q603845) (← links)
- Generalized ham-sandwich cuts (Q603848) (← links)
- On clustering bodies: geometry and polyhedral approximation (Q603849) (← links)
- Some results on greedy embeddings in metric spaces (Q603850) (← links)
- VC dimensions of principal component analysis (Q603853) (← links)
- Decomposition of multiple coverings into more parts (Q603854) (← links)
- Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space (Q603856) (← links)
- Sum complexes---a new family of hypertrees (Q603857) (← links)
- Čech type approach to computing homology of maps (Q603858) (← links)
- A measure of non-convexity in the plane and the Minkowski sum (Q603859) (← links)
- Vertex numbers of weighted faces in Poisson hyperplane mosaics (Q603860) (← links)
- Hitting simplices with points in \(\mathbb R^{3}\) (Q603863) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Even- vs. odd-dimensional Charney-Davis conjecture (Q603867) (← links)
- Symmetric versions of Laman's theorem (Q603868) (← links)
- Covers \(\mathcal P\) for abstract regular polytopes \(\mathcal {Q}\) such that \(\mathcal{Q}=\mathcal{P}/\mathbb{Z}_{p}^{k}\) (Q603869) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- On lines and joints (Q603871) (← links)
- Tiling polygons with lattice triangles (Q603872) (← links)
- The number of generalized balanced lines (Q603873) (← links)
- An Eberhard-like theorem for pentagons and heptagons (Q603874) (← links)
