The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 50 items.
- Rectangling a rectangle (Q677022) (← links)
- On critical orientations in the Kedem-Sharir motion planning algorithm (Q677023) (← links)
- On-line Steiner trees in the Euclidean plane (Q685176) (← links)
- Computing the volume, counting integral points, and exponential sums (Q685177) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Topological representation of dual pairs of oriented matroids (Q688007) (← links)
- Combinatorial models for the finite-dimensional Grassmannians (Q688009) (← links)
- Oriented matroids with few mutations (Q688011) (← links)
- Two constructions of oriented matroids with disconnected extension space (Q688012) (← links)
- Combinatorial obstructions to the lifting of weaving diagrams (Q688013) (← links)
- ``What is a complex matroid?'' (Q688014) (← links)
- Regular polytopes of full rank (Q701771) (← links)
- Computing the writhing number of a polygonal knot (Q701774) (← links)
- Chiral polyhedra in ordinary space. I (Q701775) (← links)
- The Kneser-Poulsen conjecture for spherical polytopes (Q701776) (← links)
- Cell complexities in hyperplane arrangements (Q701778) (← links)
- Construction of a 3/4-ideal hyperbolic tetrahedron out of ideal tetrahedra (Q701780) (← links)
- The integer hull of a convex rational polytope (Q701781) (← links)
- A small cover for convex unit arcs (Q701784) (← links)
- The Alexandroff dimension of quotients of \(\mathbb{R}^2\) (Q701785) (← links)
- Metric embeddings -- beyond one-dimensional distortion (Q701786) (← links)
- An inequality for circle packings proved by semidefinite programming (Q701787) (← links)
- A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (Q701788) (← links)
- On linear programming bounds for spherical codes and designs (Q701789) (← links)
- Decompositions and connectivity of matching and chessboard complexes (Q701790) (← links)
- No Helly theorem for stabbing translates by lines in \(\mathbb{R}^3\) (Q701792) (← links)
- Mazur sets in normed spaces (Q701793) (← links)
- Crumpled cube and solid horned sphere space fillers (Q701794) (← links)
- Sharp bounds for vertical decompositions of linear arrangements in four dimensions (Q701796) (← links)
- Classes of discrete convexity properties (Q701799) (← links)
- The number of isosceles right triangles determined by \(n\) points in convex position in the plane (Q701800) (← links)
- An area derivative of a space-filling diagram (Q705122) (← links)
- Unflippable tetrahedral complexes (Q705123) (← links)
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem (Q705124) (← links)
- Stabbing Delaunay tetrahedralizations (Q705126) (← links)
- Convexity properties of the cone of nonnegative polynomials (Q705127) (← links)
- Directed trees in a string, real polynomials with triple roots, and chain mails (Q705128) (← links)
- Approximation of the normal vector field and the area of a smooth surface (Q705129) (← links)
- Hierarchical decompositions and circular ray shooting in simple polygons (Q705130) (← links)
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set (Q705131) (← links)
- The inverse moment problem for convex polytopes (Q714983) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Simplicial arrangements with up to 27 lines (Q714986) (← links)
- An application of shadow systems to Mahler's conjecture (Q714987) (← links)
- Coning, symmetry and spherical frameworks (Q714988) (← links)
