Polygon Queries for Convex Hulls of Points

Oh, Eunjin; Ahn, Hee-Kap

doi:10.1007/978-3-319-94776-1_13

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Polygon Queries for Convex Hulls of Points

MPS-Authors

/persons/resource/persons228565

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

External Resource

No external resources are shared

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

Oh, E., & Ahn, H.-K. (2018). Polygon Queries for Convex Hulls of Points. In L. Wang, & D. Zhu (Eds.), Computing and Combinatorics (pp. 143-155). Berlin: Springer. doi:10.1007/978-3-319-94776-1_13.

Cite as: https://hdl.handle.net/21.11116/0000-0005-0B57-E

Abstract

There is no abstract available