Parallel algorithm for maximum empty L-shaped polygon

Preetham, A. J.; Krithivasan, Kamala; Rangan, C. Pandu; Sibeyn, Jop F.

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Parallel algorithm for maximum empty L-shaped polygon

MPS-Authors

Preetham, A. J.
Max Planck Society;

/persons/resource/persons45256

Rangan, C. Pandu
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Sibeyn, Jop F.
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

Preetham, A. J., Krithivasan, K., Rangan, C. P., & Sibeyn, J. F. (1996). Parallel algorithm for maximum empty L-shaped polygon. In 3rd Conference on High-Performance Computing. Los Alamitos, USA: IEEE.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB97-8

Abstract

There is no abstract available