Skip to main content
Conference Proceedings

Further computational geometry in secondary memory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 834 LNCS 514-522
DOI: 10.1007/3-540-58325-4_218
5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, further computational geometry in secondary memory are studied. The secondary memory models used are simple and practical. Efficient and practical solutions are given to solve secondary memory decomposable set problems. Some of the previous results are improved and some open questions are partially answered.

Cite

CITATION STYLE

APA

Zhu, B. (1994). Further computational geometry in secondary memory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 514–522). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_218

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free