Computing the center region and its variants

DOI10.1016/j.tcs.2018.06.026zbMath1430.68382arXiv1910.12169OpenAlexW2588863181MaRDI QIDQ2272371

Eunjin Oh, Hee-Kap Ahn

Publication date: 10 September 2019

Published in: Theoretical Computer Science, WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.12169

zbMATH Keywords

Tukey depthcenterpointTukey mediancenter regioncolorful center regioncolorful Tukey median

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Unnamed Item ⋮ Optimal Algorithms for Geometric Centers and Depth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Voronoi diagram for services neighboring a highway
• Cutting hyperplanes for divide-and-conquer
• Computing a centerpoint of a finite planar set of points in linear time
• Computing the Smallest Color-Spanning Axis-Parallel Square
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Parallel Merge Sort
• Separators for sphere-packings and nearest neighbor graphs
• Slowing down sorting networks to obtain faster sorting algorithms
• Algorithms for center and Tverberg points
• Algorithms for center and Tverberg points
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
• A Theorem on General Measure

This page was built for publication: Computing the center region and its variants