Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Points, spheres, and separators: a unified geometric approach to graph partitioning
Points, spheres, and separators: a unified geometric approach to graph partitioning
The colored Tverberg's problem and complexes of injective functions
Journal of Combinatorial Theory Series A
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
The m-core properly contains the m-divisible points in space
Pattern Recognition Letters - Special issue on computational geometry
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computing Many Faces in Arrangements of Lines and Segments
SIAM Journal on Computing
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
The discrepancy method: randomness and complexity
The discrepancy method: randomness and complexity
Lectures on Discrete Geometry
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On Center Regions and Balls Containing Many Points
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Computing a center-transversal line
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Byzantine vector consensus in complete graphs
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We present a near-quadratic algorithm for computing the center regionof a set of n points in three dimensions. This is nearly tight inthe worst case since the center region can have Ω(n2) complexity. We then consider the problem of recognizing whether a given point q is a colored Tverberg point of a set of n colored points in the plane, and present the first polynomial-time algorithm for this problem.