scientific article; zbMATH DE number 4213496

MaRDI QIDQ3359798zbMATH OpenFDO

Authors Jiří Matoušek

Publication date 1991

zbMATH Keywords

centerpointsconvex hullTukey depth

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing a centerpoint of a finite planar set of points in linear time
• Algorithms for center and Tverberg points
• Computing a Center-Transversal Line
• Optimal algorithms for geometric centers and depth

Cited in

(20)

• Point set stratification and Delaunay depth
• Reporting points in halfspaces
• Computing a centerpoint of a finite planar set of points in linear time
• The discrete Voronoi game in \(\mathbb{R}^2\)
• Algorithms for bivariate zonoid depth
• Approximate center points in dense point sets
• Computing Plurality Points and Condorcet Points in Euclidean Space
• Computing a high depth point in the plane
• On Computing the Centroid of the Vertices of an Arrangement and Related Problems
• scientific article; zbMATH DE number 6801906 (Why is no real title available?)
• Tukey depths and Hamilton-Jacobi differential equations
• Extending the centerpoint theorem to multiple points
• Algorithms for center and Tverberg points
• Computing a Center-Transversal Line
• scientific article; zbMATH DE number 5239206 (Why is no real title available?)
• Optimal algorithms for geometric centers and depth
• Relative (p, )-approximations in geometry
• Diameter, width, closest line pair, and parametric searching
• Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
• Centerpoints and Tverberg's technique

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359798)