Space-efficient algorithm for computing a centerpoint of a set of points in R^2
From MaRDI portal
Publication:906384
DOI10.1016/J.TCS.2015.11.048zbMATH Open1333.68252OpenAlexW2191739325MaRDI QIDQ906384FDOQ906384
Subhas C. Nandy, Sasanka Roy, Binay Bhattacharya
Publication date: 21 January 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.048
Recommendations
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved bounds for planar \(k\)-sets and related problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Finding the convex hull of a simple polygon
- Computing a centerpoint of a finite planar set of points in linear time
- Slowing down sorting networks to obtain faster sorting algorithms
- Selection and sorting with limited storage
- Upper bounds for time-space trade-offs in sorting and selection
- Comparison-based time-space lower bounds for selection
- Improved upper bounds for time-space tradeoffs for selection with limited storage
- Selection from read-only memory and sorting with minimum data movement
- Approximations and optimal geometric divide-and-conquer
- Title not available (Why is that?)
- Partitioning with two lines in the plane
- Space-time trade-offs for stack-based algorithms
- Selection from Read-Only Memory with Limited Workspace
- Selection and Sorting in the “Restore” Model
- Finding median in read-only memory on integer input
- Computing a ham-sandwich cut in two dimensions
Cited In (2)
This page was built for publication: Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906384)
