• Nenhum resultado encontrado

J. Braz. Comp. Soc. vol.9 número3

N/A
N/A
Protected

Academic year: 2018

Share "J. Braz. Comp. Soc. vol.9 número3"

Copied!
17
0
0

Texto

Loading

Imagem

Figure 1: The basic Douglas-Peucker algorithm.
Figure 4: A star-shaped polyline.
Figure 12 illustrates an application of this procedure to the polyline P in Figure 12.a
Figure 14.a illustrates a Europe’s outline with 53,626 vertices. Its Douglas-Peucker simplification with a tolerance of 4.0 contains 18 vertices and two self-intersections, which are encircled by the dashed line in Figure 14.b
+4

Referências

Documentos relacionados

Therefore, it allows a better delay control for real-time traffic in high load situations and a geater channel use for best effort traffic when low real-time traffic is present in

[r]

Proof obligations containing set theory constructs are translated to first-order logic with equality aug- mented with (an extension of) the theory of arrays with extensionality.

For example, in figure 2 we show an example of similarity with respect to logical connectives between the formulas and (for legibility reasons, each represents a ground

In the previous section we introduce Phi–calculus as a model for the design of DLEs under a particular perspective: the one of the exchanges taking place between a

[r]

[r]

This paper presents ODEd, an ontology editor that supports the definition of con- cepts, relations and properties, using graphic representations, besides promoting automatic