The research area of computational geometry deals with the design and analysis of algorithms for geo¬metric problems. The analysis of algorithms involves understanding how efficiently an algorithm solves a problem. An algorithm is considered efficient if it scales well in the input size, that is, if the time needed to solve an instance with a certain input takes a few minutes, then the time needed on an input that is ten times as large does not get out of hand completely. One of the main objectives of computational geometry is finding the most efficient algorithms for all sorts...
The Netherlands Geodetic Commission (NCG, part of the Royal Netherlands Academy of Arts and Sciences; KNAW) and Geo Information Netherlands (GIN) has organized a one day seminar 'Geo-information and Computational Geometry' on 14 November 2005. The seminar was held in the Blauwe Zaal in the Wentgebouw, known as the 'De Ponskaart', at Utrecht University, The Netherlands.
The main purpose was to show several different aspects related to spatial data structures and ...
The Subcommission Geo-Information Models (GIM) of the NCG has organized a seminar on the development and the application of 'Sensor web enablement' on Thursday 1 February 2007. The seminar has been held in the Auditorium of TNO Bouw en Ondergrond, Princetonlaan 6 in Utrecht. The seminar language was English.
The main purpose of the seminar was to show several different aspects related to location sensor services and their role with the spatial...