Topologically Correct Subdivision Simplification Using the Bandwidth Criterion

Berg, Mark de; Kreveld, Marc van; Schirra, Stefan

doi:10.1559/152304098782383007

Cited by 52 publications

(56 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The tGAP structure uses BLG (Binary Line Generalisation) trees; for each edge one tree that stores the result of the Douglas-Peucker algorithm (Douglas and Peucker, 1973) for line simplification. Here we chose for on-line simplification and use an optimisation algorithm from de Berg et al (1998).…”

Section: Filling the Structure With Generalisation Resultsmentioning

confidence: 99%

“…Our generalisation method for deriving the dataset at the lowest LoD comprises three generalisation operators that we apply in succession: A skeletonisation method that collapses narrow areas and area parts to lines (Haunert and Sester, 2008), an optimisation method that aggregates areas to satisfy size constraints (Haunert and Wolff, 2006), and an optimisation method for line simplification (de Berg et al, 1998). Figure 3 shows a sample from the input dataset ATKIS DLM 50 that we generalised with this work flow according to specifications for the ATKIS DLM 250.…”

Section: Generalisation Methods For the Lowest Lodmentioning

confidence: 99%

“…In order to avoid cluttered maps at small scale, we apply a line simplification algorithm of de Berg et al (1998) that defines the simplified line by a subsequence of the original line vertices (Fig. 3(d)).…”

Section: Generalisation Methods For the Lowest Lodmentioning

confidence: 99%

“…Galanda (2003) discusses this approach in the context of polygon maps, using a hill-climbing strategy for optimisation. Researchers in the field of computational geometry have proposed global and deterministic optimisation approaches, for example, to solve the line simplification problem (de Berg et al, 1998). Often specialised heuristics are needed to find efficient algorithms.…”

Section: Map Generalisationmentioning

confidence: 99%

See 3 more Smart Citations

Constrained set-up of the tGAP structure for progressive vector data transfer

Haunert

Dilo

Oosterom

2009

Computers & Geosciences

View full text Add to dashboard Cite

A promising approach to submit a vector map from a server to a mobile client is to send a coarse representation first, which then is incrementally refined. We consider the problem of defining a sequence of such increments for areas of different land cover classes in a planar partition. In order to submit wellgeneralised datasets, we propose a method of two stages: First, we create a generalised representation from a detailed dataset, using an optimisation approach that satisfies certain cartographic constraints. Secondly, we define a sequence of basic merge and simplification operations that transforms the most detailed dataset gradually into the generalised dataset. The obtained sequence of gradual transformations is stored without geometrical redundancy in a structure that builds up on the previously developed tGAP (topological Generalised Area Partitioning) structure. This structure and the algorithm for intermediate levels of detail (LoD) have been implemented in an object-relational database and tested for land cover data from the official German topographic dataset ATKIS at scale 1:50 000 to the target scale 1:250 000. Results of these tests allow us to conclude that the data at lowest LoD and at intermediate LoDs is well generalised. Applying specialised heuristics the applied optimisation method copes with large datasets; the tGAP structure allows users to efficiently query and retrieve a dataset at a specified LoD. Data are sent progressively from the server to the client: First a coarse representation is sent, which is refined until the requested LoD is reached.

show abstract

Section: Filling the Structure With Generalisation Resultsmentioning

confidence: 99%

Section: Generalisation Methods For the Lowest Lodmentioning

confidence: 99%

Section: Generalisation Methods For the Lowest Lodmentioning

confidence: 99%

Section: Map Generalisationmentioning

confidence: 99%

See 2 more Smart Citations

Constrained set-up of the tGAP structure for progressive vector data transfer

Haunert

Dilo

Oosterom

2009

Computers & Geosciences

View full text Add to dashboard Cite

show abstract

“…This issue was considered in Jones et al (2000), who also presented a scheme for keeping track of different levels of topological consistency. Several algorithms have been presented for generalising lines in a topologically consistent manner, including de Berg (1998), Saalfield (1999), van der Poorten and Jones (1999) and Ai et al (2000), but there has been little progress in the application of such procedures for priority labelling of vertices in a multi-scale database in order to guarantee topological consistency across retrieved levels of detail of the line and area primitives.…”

Section: Multi-scale Spatial Data Access Schemesmentioning

confidence: 99%

Topologically-Consistent Map Generalisation Procedures and Multi-scale Spatial Databases

Poorten

Zhou

Jones

2002

Geographic Information Science

View full text Add to dashboard Cite

Abstract. An important requirement of multiscale spatial databases is that topological consistency is maintained both within individual features and between co-displayed features for all scales at which they may be retrieved.Here we show how a triangulation-based branch-pruning generalisation procedure can be enhanced to enable its output to be used to build topologically-consistent multiscale data structures. A major limitation of existing branch-pruning methods, of the lack of vertex filtering, is overcome by the application of a topologically consistent, vertex priority labelling procedure. The branch pruning generalisation method is also improved by the introduction of an edge re-sampling technique and the provision of control over single and double-sided application of pruning. Experimental results of the use of the techniques are presented.

show abstract

Transmitting Vector Geospatial Data across the Internet

Buttenfield

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Topologically Correct Subdivision Simplification Using the Bandwidth Criterion

Cited by 52 publications

References 0 publications

Constrained set-up of the tGAP structure for progressive vector data transfer

Constrained set-up of the tGAP structure for progressive vector data transfer

Topologically-Consistent Map Generalisation Procedures and Multi-scale Spatial Databases

Transmitting Vector Geospatial Data across the Internet

Contact Info

Product

Resources

About