The EGC paradigm  has been very successful at handling the issues of non-robustness in geometric algorithms. The major software libraries LEDA  and CGAL are based upon this paradigm. Some of the most fundamental problems in this area are developing fast and reliable algorithms to compute with algebraic numbers, and to compute isotopic arrangements of curves and surfaces. These problems are relevant in practice, such as in CAD modeling and meshing of surfaces, as well as are interesting from a theoretical perspective (e.g., deriving tight bounds on their complexity).

  • Investigators on Indian Side: Vikram Sharma
  • Investigators on German Side: Michael Sagraloff, Eric Berberich, Pavel Emeliyanenko

Upcoming

No events

News

  • The deadline for applying for student exchange is March 30, 2015. Students enrolled in a Ph.D. programme at any Indian…
    Read more...
Copyright © 2017 Joomla! demo site. All Rights Reserved.
Joomla! is Free Software released under the GNU/GPL License.