Description of the Ruas Displacement Algorithm for Buildings in a Block
- Date 20/07/2017.
- Author: Guillaume Touya
- Contact {firstname.lastname}@ign.fr.
Description of the algorithm
This algorithm amalgamates and simplifies close buildings while retaining their square shapes, using sequences of morphological dilation and erosion (with a square instead of the standard circle to preserve building shapes). The algorithm works as follows:
- dilation
- erosion
- erosion
- dilation
- simplification
That is the dilation step that amagamates the buildings when they are close enough, i.e. if the gap between the buildings is smaller than the size of the dilation.
The initial paper by Damen et al., presented at 12th ICA Workshop on Generalisation and Multiple Representation in 2008 (Montpellier, France), can be found here The code of the algorithm can be found here.
| Parameter name | Description | Type | Default value |
|---|---|---|---|
| bufferSize | the size of the square used for the Minkowski sums and differences | double (meters) | |
| edgeLength | edge under this length are removed by the edge simplification step | double (meters) | should be smaller than bufferSize |
Examples of generalization
When to use the algorithm?
The algorithm is dedicated to the attached or semi-detached alignments of buildings that we can usually find in countries such as UK or the Netherlands.