The following pages link to (Q3974990):
Displaying 17 items.
- About \(f\)-vectors of inscribed simplicial polytopes (Q282733) (← links)
- An algorithm for approximate multiparametric convex programming (Q853676) (← links)
- Infinite faces of a perfect Voronoi polyhedron (Q869803) (← links)
- Bounding the number of \(k\)-faces in arrangements of hyperplanes (Q1175787) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- An upper bound on average touching number of a Voronoi partition (Q1262313) (← links)
- The expected number of \(k\)-faces of a Voronoi diagram (Q1309732) (← links)
- Neighborly inscribed polytopes and Delaunay triangulations (Q1707359) (← links)
- Rigid ball-polyhedra in Euclidean 3-space (Q1943668) (← links)
- Upper and lower bounds for the Voronoi-Minkowski constant (Q1957077) (← links)
- Upper bounds on the maximal number of facets of 0/1-polytopes (Q1964653) (← links)
- Scribability problems for polytopes (Q2359975) (← links)
- Realizing RCC8 networks using convex regions (Q2512988) (← links)
- From the Kneser-Poulsen conjecture to ball-polyhedra (Q2519775) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Pushing disks apart - the Kneser-Poulsen conjecture in the plane (Q4782305) (← links)
- (Q5490398) (← links)
