Topic:Computational geometry

Please help improve the educational quality of this resource to increase engagement by participants. Any concrete improvements made by June 16, 2016 may allow it to be kept. You may remove {{proposed deletion}} from this resource's source text to contest this proposal, with or without discussion. 
Please help develop and classify this resource
Learn how you can develop this resource to teach participants about Computational geometry. Choose a subject, education level, and resource type to classify the resource by. You may learn more about the topic to help you develop and classify the resource from: 
Welcome to the Department of Computational Geometry!
In computer science, computational geometry is the study of algorithms to solve problems stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and the study of such problems is also considered to be part of computational geometry.
The main impetus for the development of computational geometry as a discipline was progress in computer graphics, computeraided design and manufacturing (CAD/CAM), but many problems in computational geometry are classical in nature.
Other important applications of computational geometry include robotics (motion planning and visibility problems), geographic information systems (GIS) (geometrical location and search, route planning), integrated circuit design (IC geometry design and verification), computeraided engineering (CAE) (programming of numerically controlled (NC) machines).
The three main branches of computational geometry are:
 Combinatorial computational geometry, also called algorithmic geometry, which deals with geometric objects as discrete entities.
 Numerical geometry, also called machine geometry, computeraided geometric design (CAGD), or geometric modelling, which deals primarily with representing realworld objects in forms suitable for computer computations in CAD /CAM systems. This branch may be seen as a further development of descriptive geometry and is often considered a branch of computer graphics and/or CAD, whereas the former branch is often called simply computational geometry.
 Nonnumerical geometry, which studies and develops nonnumerical geometrical algorithms. This is the oldest branch of computational geometry which goes back to geometric constructions with the help of ruler and compass. Algorithms of geometric constructions are the soul and the origin of geometry and are not numerical in nature. Although until recently such constructions could be performed with the help of a ruler and compass only, two decades ago new means of geometric constructions emerged. These were various optical devices capable of manipulating images of geometrical figures, such as mirrors, beam splitters, holograms, etc. The observation that geometric constructions can be performed optically rather than with the help of ruler and compass laid in the foundation of "Optical Computational Geometry" put forward by Yevgeny Karasik in 1990.
Contents
Department news[edit]
 February 28, 2007  Department founded!
Learning projects[edit]
Research[edit]
Hello: Having taught and researched the classical geometry of optical systems for a number of years, I am currently preparing some new nomograms/nomographs for publication, these in the area of multimirror/lens systems [ e.g. kaleidoscopes]. I would be very interested to discuss similar work.
Philip Bradfield MA MSc MInstP CPhys FHEA lately Senior Lecturer (Physics and Computer Science),
University of Wolverhampton
Dunfermline, Fife, Scotland 07944555460
philipbradfield2@gmail.com