The Sutherland-Hodgman polygon clipping algorithm clips a polygon by comparing it against each boundary of a clipping region in turn. It processes vertices of the polygon sequentially, testing whether each vertex is inside or outside the boundary. Vertices are saved or discarded to generate a new sequence defining the clipped polygon for the next boundary. The algorithm repeats this process for all boundaries to fully clip the polygon within the region.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Sutherland hodgman polygon clipping algorithmTawfiq Ahmed
Sutherland Hodgman polygon clipping algorithm is a very simple clipping algorithm to understand. I hope my slide will help you guys.
-Thanks
Tawfiq Ahmed
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
More Related Content
Similar to Sutherland Hodgman Polygon Clipping Technique.pptx
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Sutherland hodgman polygon clipping algorithmTawfiq Ahmed
Sutherland Hodgman polygon clipping algorithm is a very simple clipping algorithm to understand. I hope my slide will help you guys.
-Thanks
Tawfiq Ahmed
Similar to Sutherland Hodgman Polygon Clipping Technique.pptx (12)
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
1. Sutherland-Hodgman Area Clipping Algorithm
A technique for clipping areas developed by Sutherland &
Hodgman
Put simply the polygon is clipped by comparing it against
each boundary in turn
Original Area Clip Left Clip Right Clip Top Clip Bottom
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
2. Left
Clipper
Right
Clipper
Bottom
Clipper
Top Clipper
At each step, a new sequence of
output vertices is generated and
passed to the next window
boundary clipper.
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
3. Sutherland-Hodgman Polygon Clipping
There are four possible cases when
processing vertices in sequence around the
perimeter of a polygon.
As each pair of adjacent polygon vertices
is passed to a next window boundary clipper,
we make the following tests:
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
4. 1. If the first vertex is outside the window
boundary and the second vertex is inside
Then , both the intersection point of the polygon
edge with the window boundary and the
second vertex are added to the output vertex
list.
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
5. 2. If both input vertices are inside the
window boundary.
Then, only the second vertex is added to
the output vertex list.
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
6. 3. If the first vertex is inside the window
boundary and the second vertex is outside.
Then, only the edge intersection with the window
boundary is added to the output vertex list.
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
7. 4. If both input vertices are outside the
window boundary.
Then, nothing is added to the output vertex
list.
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
8. Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
9. Sutherland-Hodgman Polygon Clipping (Example)
We illustrate this algorithm by processing the area
in figure against the left window boundary.
Vertices 1 and 2 are outside of the
boundary.
Vertex 3, which is inside, 1' and vertex
3 are saved.
Vertex 4 and 5 are inside, and they
also saved.
Vertex 6 is outside, 5' is saved.
Using the five saved points, we would
repeat the process for the next
window boundary.
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
10. To clip an area against an individual boundary:
• Consider each vertex in turn against the
boundary
• Vertices inside the boundary are saved for
clipping against the next boundary
• Vertices outside the boundary are clipped
• If we proceed from a point inside the
boundary to one outside, the intersection of
the line with the boundary is saved
• If we cross from the outside to the inside
intersection point and the vertex are saved
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
11. Sutherland-Hodgman Example
Each example shows the
point being processed
(P) and the previous
point (S)
Saved points define area
clipped to the boundary
in question
S
P
Save Point P
S
P
Save Point I
I
P
S
No Points Saved
S
P
Save Points I & P
I
Prof. Jeo Joy A, Dept. of Computer Science UG, Kristu jayanti
College(Autonomous) Bengaluru
