Stabbing Rectangles by Line Segments - How Decomposition Reduces the 
Shallow-Cell Complexity

Chan, Timothy M.; van Dijk, Thomas C.; Fleszar, Krzysztof; Spoerhase, Joachim; Wolff, Alexander

doi:10.4230/LIPIcs.ISAAC.2018.61

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

MPS-Authors

/persons/resource/persons216986

Fleszar, Krzysztof
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2018/10009/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Chan, T. M., van Dijk, T. C., Fleszar, K., Spoerhase, J., & Wolff, A. (2018). Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. In W.-L. Hsu, D.-T. Lee, & C.-S. Liao (Eds.), 29th International Symposium on Algorithms and Computation (pp. 1-13). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ISAAC.2018.61.

Cite as: https://hdl.handle.net/21.11116/0000-0002-ADEA-4

Abstract

There is no abstract available