Document Open Access Logo

Asymmetric Convex Intersection Testing

Authors Luis Barba, Wolfgang Mulzer

PDF

File

Thumbnail PDF
PDF
OASIcs.SOSA.2019.9.pdf
  • Filesize: 0.61 MB
  • 14 pages

Document Identifiers

Subject Classification

Keywords
  • polytope intersection
  • LP-type problem
  • randomized algorithm

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We consider asymmetric convex intersection testing (ACIT). 
Let P subset R^d be a set of n points and H a set of n halfspaces in d dimensions. We denote by {ch(P)} the polytope obtained by taking the convex hull of P, and by {fh(H)} the polytope obtained by taking the intersection of the halfspaces in H. Our goal is to decide whether the intersection of H and the convex hull of P are disjoint. Even though ACIT is a natural variant of classic LP-type problems that have been studied at length in the literature, and despite its applications in the analysis of high-dimensional data sets, it appears that the problem has not been studied before. 
We discuss how known approaches can be used to attack the ACIT problem, and we provide a very simple strategy that leads to a deterministic algorithm, linear on n and m, whose running time depends reasonably on the dimension d.

Cite As Get BibTex

Luis Barba and Wolfgang Mulzer. Asymmetric Convex Intersection Testing. In 2nd Symposium on Simplicity in Algorithms (SOSA 2019). Open Access Series in Informatics (OASIcs), Volume 69, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/OASIcs.SOSA.2019.9

Author Details

Luis Barba
Wolfgang Mulzer

References

  1. Luis Barba and Stefan Langerman. Optimal detection of intersections between convex polyhedra. In Proc. 26th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 1641-1654, 2015. Google Scholar
  2. Timothy M. Chan. An optimal randomized algorithm for maximum Tukey depth. In Proc. 15th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 430-436, 2004. Google Scholar
  3. Timothy M Chan. Improved deterministic algorithms for linear programming in low dimensions. ACM Trans. Algorithms, 14(3):30, 2018. Google Scholar
  4. Timothy M Chan. Personal communication, 2018. Google Scholar
  5. B. Chazelle and D. Dobkin. Intersection of Convex Objects in Two and Three Dimensions. J. ACM, 34(1):1-27, January 1987. Google Scholar
  6. Bernard Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM J. Comput., 21:586-591, 1992. Google Scholar
  7. Bernard Chazelle. An Optimal Convex Hull Algorithm in Any Fixed Dimension. Discrete Comput. Geom., 10:377-409, 1993. Google Scholar
  8. Bernard Chazelle. The Discrepancy Method - Randomness and Complexity. Cambridge University Press, 2001. Google Scholar
  9. Bernard Chazelle and David Dobkin. Detection is Easier than Computation (Extended Abstract). In Proc. 12th Annu. ACM Sympos. Theory Comput. (STOC), pages 146-153, 1980. Google Scholar
  10. Vašek Chvátal. Linear programming. A Series of Books in the Mathematical Sciences. W. H. Freeman, 1983. Google Scholar
  11. Kenneth L. Clarkson. A Las Vegas Algorithm for Linear Programming When the Dimension Is Small. In Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), pages 452-456, 1988. Google Scholar
  12. Kenneth L. Clarkson and Peter W. Shor. Application of Random Sampling in Computational Geometry, II. Discrete Comput. Geom., 4:387-421, 1989. Google Scholar
  13. David Dobkin and David Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. J. Algorithms, 6(3):381-392, 1985. Google Scholar
  14. Herbert Edelsbrunner. Computing the extreme distances between two convex polygons. J. Algorithms, 6(2):213-224, 1985. Google Scholar
  15. Sariel Har-Peled. Geometric approximation algorithms. American Mathematical Society, 2011. Google Scholar
  16. Sanjiv Kapoor and Pravin M. Vaidya. Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows. In Proc. 18th Annu. ACM Sympos. Theory Comput. (STOC), pages 147-159, 1986. Google Scholar
  17. M. K. Kozlov, S. P. Tarasov, and L. G. Hačijan. The polynomial solvability of convex quadratic programming. Zh. Vychisl. Mat. i Mat. Fiz., 20(5):1319-1323, 1359, 1980. Google Scholar
  18. Guy Louchard, Stefan Langerman, and Jean Cardinal. Randomized Optimization: a Probabilistic Analysis. Discrete Mathematics &Theoretical Computer Science, 2007. Google Scholar
  19. Jiří Matoušek. Linear Optimization Queries. J. Algorithms, 14(3):432-448, 1993. Google Scholar
  20. Jiří Matoušek. Lectures on Discrete Geometry. Springer-Verlag, 2002. Google Scholar
  21. David E. Muller and Franco P. Preparata. Finding the intersection of two convex polyhedra. Theoret. Comput. Sci., 7(2):217-236, 1978. Google Scholar
  22. Franco P. Preparata and Michael Ian Shamos. Computational Geometry-An Introduction. Springer-Verlag, 1985. Google Scholar
  23. Raimund Seidel. Small-Dimensional Linear Programming and Convex Hulls Made Easy. Discrete Comput. Geom., 6:423-434, 1991. Google Scholar
  24. Micha Sharir and Emo Welzl. A combinatorial bound for linear programming and related problems. Proc. 9th Sympos. Theoret. Aspects Comput. Sci. (STACS), pages 567-579, 1992. Google Scholar
  25. Günter M. Ziegler. Lectures on Polytopes. Springer-Verlag, 1995. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact