The following pages link to Discrete \& Computational Geometry (Q178842):
Displaying 50 items.
- Necessary conditions for the generic global rigidity of frameworks on surfaces (Q464737) (← links)
- On the maximum number of independent elements in configurations of points and lines (Q464738) (← links)
- Volume in general metric spaces (Q464741) (← links)
- A new topological Helly theorem and some transversal results (Q464742) (← links)
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- On the chromatic number of \(\mathbb R^4\) (Q464746) (← links)
- Efficiently hex-meshing things with topology (Q471135) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations (Q471140) (← links)
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing (Q471143) (← links)
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- Decidability of the extension problem for maps into odd-dimensional spheres (Q512251) (← links)
- The realizability of curves in a tropical plane (Q512254) (← links)
- Tverberg partitions of points on the moment curve (Q512255) (← links)
- Semidefinite approximations of conical hulls of measured sets (Q512256) (← links)
- The number of holes in the union of translates of a convex set in three dimensions (Q512258) (← links)
- Vertex-transitive polyhedra of higher genus. I (Q512259) (← links)
- Stability inequalities for projections of convex bodies (Q512260) (← links)
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- On the Beer index of convexity and its variants (Q512263) (← links)
- On the combinatorics of Demoulin transforms and (discrete) projective minimal surfaces (Q512265) (← links)
- Inverse Littlewood-Offord problems for quasi-norms (Q512266) (← links)
- Straight line triangle representations (Q517440) (← links)
- Universal rigidity of complete bipartite graphs (Q517442) (← links)
- Quasiconformal dilatation of projective transformations and discrete conformal maps (Q517445) (← links)
- Quantitative combinatorial geometry for continuous parameters (Q517447) (← links)
- Generating maps on surfaces (Q517449) (← links)
- Invariant measure of rotational beta expansion and Tarski's Plank problem (Q517451) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- Diameter bounded equal measure partitions of Ahlfors regular metric measure spaces (Q517455) (← links)
- Discrete uniformization of polyhedral surfaces with non-positive curvature and branched covers over the sphere via hyper-ideal circle patterns (Q517458) (← links)
- Bounds on the number of connected components for tropical prevarieties (Q517460) (← links)
- Quantitative Helly-type theorem for the diameter of convex sets (Q517461) (← links)
- Encoding toroidal triangulations (Q527433) (← links)
- Voronoi-based estimation of Minkowski tensors from finite point samples (Q527434) (← links)
- \(\mathrm{SL}(n)\) invariant valuations on polytopes (Q527435) (← links)
- Unique determination of convex lattice sets (Q527438) (← links)
- Box representations of embedded graphs (Q527439) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- What happens to a manifold under a bi-Lipschitz map? (Q527443) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Incidences between points and lines in \({\mathbb {R}}^4\) (Q527445) (← links)
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446) (← links)
- Special issue: 25th annual symposium on computational geometry (SoCG 2009). Selected papers based on the presentations at the symposium, Aarhus, Denmark, June 2009. (Q537342) (← links)
- \(k\)-means requires exponentially many iterations even in the plane (Q540436) (← links)
- Binary plane partitions for disjoint line segments (Q540437) (← links)
- Minimum Manhattan network is NP-complete (Q540439) (← links)
- Kinetic spanners in \(\mathbb R^{d}\) (Q540440) (← links)
