scientific article; zbMATH DE number 1962801

zbMath1036.90512MaRDI QIDQ4418636

William Steiger, Stefan Langerman

Publication date: 11 August 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070050.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (16)

The discrete Voronoi game in \(\mathbb{R}^2\) ⋮ Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem ⋮ A survey of mass partitions ⋮ On Liu's simplicial depth and Randles' interdirections ⋮ Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. ⋮ A center transversal theorem for hyperplanes and applications to graph drawing ⋮ Unnamed Item ⋮ A proof of the Oja depth conjecture in the plane ⋮ On Combinatorial Depth Measures ⋮ Algorithms for bivariate zonoid depth ⋮ Bisecting three classes of lines ⋮ On the Number of Radial Orderings of Colored Planar Point Sets ⋮ Computing the center region and its variants ⋮ Extending the centerpoint theorem to multiple points ⋮ An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon ⋮ Optimal Algorithms for Geometric Centers and Depth

This page was built for publication: