Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Simplification key

Simplification key

Database System Concepts
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
icon
Related questions
Question
max edge distance Simplification key Figure 4-1: A sample process for the Douglas-Peucker algorithm 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.
Transcribed Image Text:max edge distance Simplification key Figure 4-1: A sample process for the Douglas-Peucker algorithm 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.
(2) Suppose we have an abstract data type (ADT) of Point that contains the x-axis and y-axis of a point. We also have a function pDistance that computes the perpendicular distance from p to line ab. The input of pDistance is (p,a, b), and the return value is a float value representing the distance. Fill in the function farthestPoint regarding how to locate the point with the maximum perpendicular distance to the starting point points[0] and the ending point points[- 1]. def pDistance(p, a, b): # p, a, b are of type Point # return the distance from p to line ab def farthestPoint(points): # points is a list of type Point maxIdx = 1 maxDist = 0 for idx in range (1, len(points) - 1): dist ®_, points[-1]) %3D if _@. maxIdx = idx maxDist = dist %3D # returns the index and distance of the farthest point return maxIdx, maxDist
Transcribed Image Text:(2) Suppose we have an abstract data type (ADT) of Point that contains the x-axis and y-axis of a point. We also have a function pDistance that computes the perpendicular distance from p to line ab. The input of pDistance is (p,a, b), and the return value is a float value representing the distance. Fill in the function farthestPoint regarding how to locate the point with the maximum perpendicular distance to the starting point points[0] and the ending point points[- 1]. def pDistance(p, a, b): # p, a, b are of type Point # return the distance from p to line ab def farthestPoint(points): # points is a list of type Point maxIdx = 1 maxDist = 0 for idx in range (1, len(points) - 1): dist ®_, points[-1]) %3D if _@. maxIdx = idx maxDist = dist %3D # returns the index and distance of the farthest point return maxIdx, maxDist
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS