Key-problems and key-methods in computational geometry

H. Edelsbrunner, in:, Springer, 1984, pp. 1–13.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Series Title
LNCS
Abstract
Computational geometry, considered a subfield of computer science, is concerned with the computational aspects of geometric problems. The increasing activity in this rather young field made it split into several reasonably independent subareas. This paper presents several key-problems of the classical part of computational geometry which exhibit strong interrelations. A unified view of the problems is stressed, and the general ideas behind the methods that solve them are worked out.
Publishing Year
Date Published
1984-01-01
Volume
166
Page
1 - 13
Conference
STACS: Theoretical Aspects of Computer Science
IST-REx-ID

Cite this

Edelsbrunner H. Key-problems and key-methods in computational geometry. In: Vol 166. Springer; 1984:1-13. doi:10.1007/3-540-12920-0_1
Edelsbrunner, H. (1984). Key-problems and key-methods in computational geometry (Vol. 166, pp. 1–13). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/3-540-12920-0_1
Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry,” 166:1–13. Springer, 1984. https://doi.org/10.1007/3-540-12920-0_1.
H. Edelsbrunner, “Key-problems and key-methods in computational geometry,” presented at the STACS: Theoretical Aspects of Computer Science, 1984, vol. 166, pp. 1–13.
Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 166. 1–13.
Edelsbrunner, Herbert. Key-Problems and Key-Methods in Computational Geometry. Vol. 166, Springer, 1984, pp. 1–13, doi:10.1007/3-540-12920-0_1.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar