Work

External-memory computational geometry

Year: 2002

Type: conference-paper

Abstract: In this paper we give new techniques for designing efficient algorithms for computational geometry problems that are too large to be solved in internal memory. We use these techniques to develop optimal and practical algorithms for a number of important large-scale problems. We discuss our algorithms primarily in the context of single processor/single disk machines, a domain in which they are not only the first known optimal results but also of tremendous practical value. Our methods also produce the first known optimal algorithms for a wide range of two-level and hierarchical multilevel memory models, including parallel models. The algorithms are optimal both in terms of I/O cost and internal computation.>

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1993.366816

Authors: M.T. Goodrich, Jyh-Jong Tsay, D.E. Vengroff, J.S. Vitter

Institutions: Johns Hopkins University, National Chung Cheng University, Duke University

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2100059510

FWCI: 7.14

Cites: 41

Cited by: 202

Related to: 10