2011
DOI: 10.1590/s1982-21702011000200001
|View full text |Cite
|
Sign up to set email alerts
|

A zone-based iterative building displacement method through the collective use of Voronoi Tessellation, spatial analysis and multicriteria decision making

Abstract: An iterative displacement method working based on generalisation zones is proposed as a part of contextual building generalisation in topographic map production at medium scales. Displacement is very complicated operation since a compromise ought to be found between several conflicting criteria. Displacement requirement mainly arises from the violation of minimum distances imposed by graphic limits after the enlargement of map objects for target scale. It is also important to maintain positional accuracy withi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(16 citation statements)
references
References 14 publications
0
14
0
Order By: Relevance
“…If multiple polygons are in conflict, the pairwise displacement algorithm cannot guarantee that the minimum separability constraint is met everywhere, as it is unable to safeguard against possible knock-on effects when, e.g., a polygon is pushed into another, neighboring polygon that would then also need to be displaced. Therefore, conflict zones involving three or more polygons are handled and are achieved by a Voronoi-based displacement approach inspired by algorithms using Voronoi or Voronoi-like cells to control the displacement [42,43]. We devised two algorithms to implement the displacement operator: a simple pairwise displacement algorithm used when only two polygons are in conflict, and a Voronoi-based algorithm for cases involving multiple polygons.…”
Section: Displacementmentioning
confidence: 99%
“…If multiple polygons are in conflict, the pairwise displacement algorithm cannot guarantee that the minimum separability constraint is met everywhere, as it is unable to safeguard against possible knock-on effects when, e.g., a polygon is pushed into another, neighboring polygon that would then also need to be displaced. Therefore, conflict zones involving three or more polygons are handled and are achieved by a Voronoi-based displacement approach inspired by algorithms using Voronoi or Voronoi-like cells to control the displacement [42,43]. We devised two algorithms to implement the displacement operator: a simple pairwise displacement algorithm used when only two polygons are in conflict, and a Voronoi-based algorithm for cases involving multiple polygons.…”
Section: Displacementmentioning
confidence: 99%
“…Basaraner [18] used a Voronoi graph to determine building displacement. In this approach, an operational area for displacement is formed by the overlay of the Voronoi area and a building buffering area.…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, raster data are used to detect conflicts, and displacement vectors are calculated to resolve these conflicts. Basaraner () proposed a building displacement method based on a Voronoi graph. He first used the overlay of a building's Voronoi region and buffer to form the displacement region, then used a multi‐factor evaluation method to determine displacement object.…”
Section: Related Workmentioning
confidence: 99%