MANTYLA@SU-SIERRA.ARPA (01/06/84)
From: Martti Mantyla <MANTYLA@SU-SIERRA.ARPA>
[Reprinted from the SU-SCORE bboard.]
NEW COURSE:
EE392 DATA STRUCTURES AND ALGORITHMS
FOR GEOMETRIC PROBLEMS
Many problems arising in science and engineering deal with geometric
information. Engineering design is most often spatial activity, where a
physical shape with certain desired properties must be created. Engineering
analysis also uses heavily information on the geometric form of the object.
The seminar Data Structures and Algorithms for Geometric Problems deals with
problems related to representing and processing data on the geometric shape of
an object in a computer. It will concentrate on practically interesting
solutions to tasks such as
- representation of digital images,
- representation of line figures,
- representation of three-dimensional solid objects, and
- representation of VLSI circuits.
The point of view taken is hence slightly different from a "hard-core"
Computational Geometry view that puts emphasis on asymptotic computational
complexity. In practice, one needs solutions that can be implemented in a
reasonable time, are efficient and robust enough, and can support an
interesting scope of applications. Of growing importance is to find
representations and algorithms for geometry that are appropriate for
implementation in special hardware and VLSI in particular.
The seminar will be headed by
Dr. Martti Mantyla (MaM)
Visiting Scholar
CSL/ERL 405
7-9310
MANTYLA@SU-SIERRA.ARPA
who will give intruductory talks. Guest speakers of the seminar include
well-known scientists and practitioners of the field such as Dr. Leo Guibas and
Dr. John Ousterhout. Classes are held on
Tuesdays, 2:30 - 3:30
in
ERL 126
First class will be on 1/10.
The seminar should be of interest to CS/EE graduate students with research
interests in computer graphics, computational geometry, or computer
applications in engineering.