Computational geometry lectures

Lecture 3: Convex Hulls in the Plane. Convexity: In this lecture we will consider a fundamental structure in computational geometry, called the convex hull

Lectures on Wednesday, February 2 and Friday February 4 will be streamed Computational geometry has immediate applications in many other research areas,

The measure of the quality of an algorithm in computational geometry has traditionally been its asymptotic worst-case running time. Thus, an algorithm running

These lecture notes are designed to accompany a course on “Computational Geometry” that we teach at the Department of Computer Science, ETH Zürich, in every

What happened to computational geometry in the 80's and 90's?

Trends in CG in the 80’s and 90’s: In spite of these limitations, there is still a remarkable array of interesting prob- lems that computational geometry has succeeded in addressing

Throughout the 80’s the field developed many techniques for the design of efficient geometric algorithms

What is a typical problem in computational geometry?

A Typical Problem in Computational Geometry: Here is an example of a typical problem, called the shortest path problem

Given a set polygonal obstacles in the plane, nd the shortest obstacle-avoiding path from some given start point to a given goal point (see Fig

What is computational geometry?

It’s most widely recognized use, however, is to describe the subeld of algorithm theory that involves the design and analysis of ecient algorithms for problems involving geometric input and output

The eld of computational geometry grew rapidly in the late 70’s and through the 80’s and 90’s, and it is still a very active eld of research

Categories