The Maximum-Level Vertex in an Arrangement of Lines

Halperin, Dan; Har-Peled, Sariel; Mehlhorn, Kurt; Oh, Eunjin; Sharir, Micha

doi:10.1007/s00454-021-00338-9

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

The Maximum-Level Vertex in an Arrangement of Lines

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons228565

Oh, Eunjin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/cFlQF
(Publisher version)

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

Halperin, D., Har-Peled, S., Mehlhorn, K., Oh, E., & Sharir, M. (2022). The Maximum-Level Vertex in an Arrangement of Lines. Discrete & Computational Geometry, 67, 439-461. doi:10.1007/s00454-021-00338-9.

Cite as: https://hdl.handle.net/21.11116/0000-0009-D020-7

Abstract

There is no abstract available