Laszlo Teleki, "Dreidimensionale Qualitative Gebäuderekonstruktion". Thesis at: Institute of Photogrammetry, University of Bonn. 1997.

• Abstract
• BibTeX

The need for three-dimensional building data for city models increased during the last years. In many case the building data are not complete or they are missing. Due to this reason the capture and update of this data is required. As the tasks are expensive, automation will help to reduce costs. This dissertation discusses the automatic reconstruction of the topology of buildings from qualitatively described three-dimensional structures. Starting point are corners of buildings, extracted on a stereo based analysis. The corners as well as their mutual relations are classified qualitatively. We present an algorithm that connects the corners to buildings. The result can then be used for a quantitative reconstruction. The exclusive use of qualitative description of three-dimensional structures for the reconstruction of the topology is a new approach. The majority of known algorithms are using numerical and statistical methods. The advantage of the qualitative framework lies in a reduction of the number of solutions in contrast numerical methods. Topological reconstruction uses geometrical informations and relations between the corners. Such are i.e. the collinearity of corner edges, the coplanarity of planes or orientation information of edges of the form the edge directs up-left. The framework contains steps for the connection of the corner edges, the reconstruction of the building planes and the consistency verification of intermediate results. A partial reconstruction of the building is done if corners are missing. The methodology transfers known methods from mathematics especially analytic geometry to a new qualitative framework. The framework and the qualitative descriptions show that qualitative reasoning are in principle suitable for building extraction.

@phdthesis{Teleki1997Dreidimensionale,
  author = {Teleki, Laszlo},
  title = {Dreidimensionale Qualitative Geb\"auderekonstruktion},
  school = {Institute of Photogrammetry, University of Bonn},
  year = {1997}
}

László Teleki, "Constraint Logic Programing - a Framework for Qualitative Reasoning", In Qualitative Reasoning, The Tenth International Workshop. Iwasaki, Yumi and Farquhar, Adam (Eds.) Lake Tahoe 1996.

• Abstract
• BibTeX
• Download

We propose to use Constraint Logic Programming (CLP) for the specification and implementation of Qualitative Reasoning (QR) problems that are specialized Constraint Satisfaction Problems. The use of CLP has two advantages: (i) CLP gives a well defined and understood logical framework for the problem specification, and (ii) CLP is not only a logical framework, it is also a family of languages specially developed for solving classes of CSP problems. Thus we obtain a class of powerful implementation languages for rapid prototyping. To illustrate the steps of specification and implementation we describe in detail the core of the QSIM algorithm tekuipers94:qualitative, namely the filtering of the state transitions in the CLP framework. We show how the basic constraints are specified in this framework and describe the technical aspects of an implementation. We want to demonstrate the advantages of CLP through an example for a large and complex qualitative reasoning algorithm.

@inproceedings{Teleki1996Constraint,
  author = {Teleki, L\'aszl\'o},
  editor = {Iwasaki, Yumi and Farquhar, Adam},
  title = {Constraint Logic Programing - a Framework for Qualitative Reasoning},
  booktitle = {Qualitative Reasoning, The Tenth International Workshop},
  year = {1996}
}

László Teleki, "Embedding Qualitative Reasoning into Constraint Logic Programming", In Proceedings of the Workshop on Constraint Programming Applications, in conjunction with the Second International Conference on Principles and Practice of Constraint Programming (CP96). Cambridge, Massachusetts, USA 1996.

• Abstract
• BibTeX
• Download

We propose to use Constraint Logic Programming (CLP) for the specification and implementation of Qualitative Reasoning (QR) problemsthat are specialized Constraint Satisfaction Problems. Although it has long been recognized that many frameworks, like the QSIM algorithm tekuipers94:qualitative can be viewed as a set of constraint satisfaction problems (CSP), the area of QR is relatively unknown in the CLP literature. In this paper we would like to present, through the language of QSIM, one set of questions and problems analyzed in the area of QR and to present the CLP specification of the key algorithm of QSIM, the c-filter. We show how the basic constraints of QSIM are specified and describe the technical aspects of our implementation.

@inproceedings{Teleki1996Embedding,
  author = {Teleki, L\'aszl\'o},
  title = {Embedding Qualitative Reasoning into Constraint Logic Programming},
  booktitle = {Proceedings of the Workshop on Constraint Programming Applications, in conjunction with the Second International Conference on Principles and Practice of Constraint Programming (CP96)},
  year = {1996}
}