The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 50 items.
- On the diameter of lattice polytopes (Q282757) (← links)
- Intrinsic volumes of random cubical complexes (Q306500) (← links)
- On computability and triviality of well groups (Q306506) (← links)
- Metric properties of semialgebraic mappings (Q309643) (← links)
- Apollonian ball packings and stacked polytopes (Q309645) (← links)
- Categorified Reeb graphs (Q309649) (← links)
- Correction to our article ``Topology of random 2-complexes'' (Q312168) (← links)
- Straight skeletons and mitered offsets of nonconvex polytopes (Q331386) (← links)
- A new lower bound based on Gromov's method of selecting heavily covered points (Q452003) (← links)
- An incidence theorem in higher dimensions (Q452010) (← links)
- On the Beer index of convexity and its variants (Q512263) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- Some results on greedy embeddings in metric spaces (Q603850) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Combinatorial models for the finite-dimensional Grassmannians (Q688009) (← links)
- Chiral polyhedra in ordinary space. I (Q701775) (← links)
- The inverse moment problem for convex polytopes (Q714983) (← links)
- Reptilings and space-filling curves for acute triangles (Q724950) (← links)
- Historical overview of the Kepler conjecture (Q734995) (← links)
- Fréchet means for distributions of persistence diagrams (Q742821) (← links)
- A Szemerédi-Trotter type theorem in \(\mathbb R^4\) (Q745661) (← links)
- Improving the crossing lemma by finding more crossings in sparse graphs (Q854708) (← links)
- On representing Sylvester-Gallai designs (Q912856) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- A dense packing of regular tetrahedra (Q958219) (← links)
- Reconstruction using witness complexes (Q958231) (← links)
- Distributions of points in \(d\) dimensions and large \(k\) -point simplices (Q958238) (← links)
- Matroid polytopes and their volumes (Q972610) (← links)
- On Kalai's conjectures concerning centrally symmetric polytopes (Q1017921) (← links)
- A resolution of the Sylvester-Gallai problem of J.-P. Serre (Q1076336) (← links)
- Two poset polytopes (Q1077721) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- A geometric inequality and the complexity of computing volume (Q1087143) (← links)
- Repeated angles in \(E_ 4\) (Q1093908) (← links)
- Nonobtuse triangulation of polygons (Q1096930) (← links)
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments (Q1098294) (← links)
- The algebraic degree of geometric optimization problems (Q1104865) (← links)
- Almost tight bounds for \(\epsilon\)-nets (Q1184160) (← links)
- The number of different distances determined by a set of points in the Euclidean plane (Q1186077) (← links)
- The Steiner ratio conjecture for cocircular points (Q1186084) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Some generalizations of the pinwheel tiling (Q1269453) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- A postscript on distances in convex \(n\)-gons (Q1314446) (← links)
- Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes (Q1329187) (← links)
- Areas of polygons inscribed in a circle (Q1334934) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
