COT5520Lec1 - Course description Description Computational...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Course description Description Computational geometry is the design and analysis of algorithms for solving geometric problems. The field emphasizes solution of geometrical problems from a computational point of view. Geometry is a very classical subject which has been by studied by Euclid, Descartes, Gauss, Hilbert, Klein and many other mathematical genius. They developed mathematical formalism for representations of geometric entities, effects of transformation in space and geometric reasoning. But they were not concerned with the efficiency of geometric computation because computers and the concep of algorithm complexities were non-existent. Solid Modeling : Design and analysis of systems for representing 3- dimensional objects and computational geometry ideas are very useful in this field. Computer Graphics : Methods for modeling and rendering scenes. Visualization of the objects of the scene on a computer screen is implicit in the definition. Visualization : Methods of rendering an image on computer screen using pixel or voxel data for objects, corresponding to surface and volume rendering. Computer Vision, Virtual Reality, Robotics use computational geometry concepts.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Computational geometry emerged as a unified discipline in 1978, with the appearance of Shamos’ Ph.D. dissertation. Since then research interest has been high. Many fascinating and beautiful results have been produced. Application areas: 1. Computer graphics 6. Computer generated forces 2. Solid modeling 7. Computer aided manufacturing 3. Terrain representation 8. Robotics 4. Virtual reality 9. Computer vision 5. Simulation 10. Image Compression 11. VLSI design Goals 1. Familiarize the student with the fundamental algorithm techniques for designing efficient algorithms dealing with collections of geometric objects. 2.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/14/2011 for the course COT 5520 taught by Professor Mukherjee during the Summer '11 term at University of Central Florida.

Page1 / 9

COT5520Lec1 - Course description Description Computational...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online