The Douglas-Peucker algorithm is for the selection of representative points to simplify a curve composed of line segments. It uses a point-to-edge distance tolerance. The algorithm starts with a crude simplification that is the single edge joining the first and last vertices of the original polyline. It then computes the perpendicular distance of all intermediate vertices to that edge. The vertex that is furthest away from that edge, and that has a computed distance that is larger than a specified tolerance, will be marked as a key and added to the simplification. This process will recurse for each edge in the current simplification until all vertices of the original polyline are within tolerance of the simplification results. This process is illustrated in Figure 4-1.

The Douglas-Peucker algorithm is for the selection of representative points to simplify a curve composed of line segments. It uses a point-to-edge distance tolerance. The algorithm starts with a crude simplification that is the single edge joining the first and last vertices of the original polyline. It then computes the perpendicular distance of all intermediate vertices to that edge. The vertex that is furthest away from that edge, and that has a computed distance that is larger than a specified tolerance, will be marked as a key and added to the simplification. This process will recurse for each edge in the current simplification until all vertices of the original polyline are within tolerance of the simplification results. This process is illustrated in Figure 4-1.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

True or false: For graphs with negative weights, one workaround to be able to use Dijkstra’s algorithm (instead of Bellman-Ford) would be to simply make all edge weights positive; for example, if the most negative weight in a graph is -8, then we can simply add +8 to all weights, compute the shortest path, then decrease all weights by -8 to return to the original graph. Select one: True False
If we need a lot of adding and removing edges to a graph, it is better to represent the graph as O Adjacency matrix O Adjacency list
Q- In order to plot a graph of f(x)=z and g(y)=z in the same graph, with t as a parameter. The function used is plot3(x,y,z) O plot(x,y,z) O surf(x,y,z) O mesh(z) O
Undirected graph is given with the list of edges. Build an adjacency matrix. Print the number of ones in adjacency matrix. Graph can contain multiple edges and loops. Input First line contains number of vertices n. Each of the next line contains one edge. Read the edges till the end of file. Output Build an adjacency matrix. Print the number of ones in adjacency matrix. Sample input 3 1 2 23 22 32 Sample output 5
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices share the same color; this is called a vertex coloring. The chromatic number of a graph is the least mumber of colors required to do a coloring of a graph. Example Here in this graph the chromatic number is 3 since we used 3 colors The degree of a vertex v in a graph (without loops) is the number of edges at v. If there are loops at v each loop contributes 2 to the valence of v. A graph is connected if for any pair of vertices u and v one can get from u to v by moving along the edges of the graph. Such routes that move along edges are known by different names: edge progressions, paths, simple paths, walks, trails, circuits, cycles, etc. a. Write down the degree of the 16 vertices in the graph below: 14…
Write pseudocode to find all pairs shortest paths using the technique used in Bellman-Ford's algorithm so that it will produce the same matrices like Floyd-Warshall algorithm produces. Also provide the algorithm to print the paths for a source vertex and a destination vertex. Describe the properties of the algorithm you provide and the run time for your algorithm in detail.
Write tests performed on the vertices of polygon edges by Sutherland Hodgeman Polygon Clipping algorithm. Apply Left, Right, Bottom and Top boundary clipping in the following polygon as is done by Sutherland Hodgeman Polygon Clipping algorithm and find the vertices of the clipped polygon.
Dijkstra's shortest path algorithm is run on the graph, starting at vertex B. When a vertex is dequeued, 0 or more adjacent vertices' distances are updated. For each iteration of the while loop in Dijkstra's algorithm, find the vertex dequeued and the adjacent vertices updated. Enter updated vertices as A, B, C or "none" if no adjacent vertices are updated. 9 B 3 A 8 5 10 E C 2 D Iteration Vertex dequeued Adjacent vertices updated 1 Ex: C Ex: A, B, C or none 2 3 + LO 5
One can manually count path lengths in a graph using adjacency matrices. Using the simple example below, produces the following adjacency matrix: A B A 1 1 B 1 0 This matrix means that given two vertices A and B in the graph above, there is a connection from A back to itself, and a two-way connection from A to B. To count the number of paths of length one, or direct connections in the graph, all one must do is count the number of 1s in the graph, three in this case, represented in letter notation as AA, AB, and BA. AA means that the connection starts and ends at A, AB means it starts at A and ends at B, and so on. However, counting the number of two-hop paths is a little more involved. The possibilities are AAA, ABA, and BAB, AAB, and BAA, making a total of five 2-hop paths. The 3-hop paths starting from A would be AAAA, AAAB, AABA, ABAA, and ABAB. Starting from B, the 3-hop paths are BAAA, BAAB, and BABA. Altogether, that would be eight 3-hop paths within this graph. Write a program…
Consider the line from (5, 5) to (13, 9).Use the Bresenham’s line drawing algorithm to draw this line. You are expected to find out all the pixels of the line and draw it on a graph paper
Specifications: You will create an implementation of this algorithm. Your driver program should provide a graph and a source vertex in the graph. Your implementation should use Dijkstra's Algorithm to determine the shortest path using adjacency matrix representation. Specifically, given a graph and a source vertex in the graph, find the shortest paths from source to all vertices in the given graph, using Dijkstra's Algorithm.
Course : Algorithm Show two possible solutions for the m-coloring problem to find all possible colorings of the graph below using the three colors red, green, and white.