Geometric algorithms | Types of polygons

Star-shaped polygon

In geometry, a star-shaped polygon is a polygonal region in the plane that is a star domain, that is, a polygon that contains a point from which the entire polygon boundary is visible. Formally, a polygon P is star-shaped if there exists a point z such that for each point p of P the segment lies entirely within P. The set of all points z with this property (that is, the set of points from which all of P is visible) is called the kernel of P. If a star-shaped polygon is convex, the link distance between any two of its points (the minimum number of sequential line segments sufficient to connect those points) is 1, and so the polygon's link diameter (the maximum link distance over all pairs of points) is 1. If a star-shaped polygon is not convex, the link distance between a point in the kernel and any other point in the polygon is 1, while the link distance between any two points that are in the polygon but outside the kernel is either 1 or 2; in this case the maximum link distance is 2. (Wikipedia).

Star-shaped polygon
Video thumbnail

What are the names of different types of polygons based on the number of sides

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What are four types of polygons

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Sketch a net from a 3D figure

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Sketch a figure from a net

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What is the definition of a regular polygon and how do you find the interior angles

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What is the difference between a regular and irregular polygon

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Robert Fathauer - Tessellations: Mathematics, Art, and Recreation - CoM Apr 2021

A tessellation, also known as a tiling, is a collection of shapes (tiles) that fit together without gaps or overlaps. Tessellations are a topic of mathematics research as well as having many practical applications, the most obvious being the tiling of floors and other surfaces. There are n

From playlist Celebration of Mind 2021

Video thumbnail

Foldable Polyhedron 2

Delta-Star is a polyhedral object which I invented in 1996. The type of Delta-Star corresponds to Deltahedrons. It expands and shrinks.

From playlist Handmade geometric toys

Video thumbnail

Inkscape Video Tutorial

Get Inkscape Here : http://inkscape.org/ Subscribe to Me: http://bit.ly/2FWQZTx Best Inkscape Book : http://goo.gl/mTAm7P Welcome to my Inkscape Video Tutorial! Inkscape is an amazing program that is almost as good as Adobe Illustrator, but it is FREE! Because I'm going to be drawing int

From playlist Inkscape Video Tutorial

Video thumbnail

What is the difference between a regular and irregular polygons

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Josh Laison - Star Numbers of Geometric Shapes - G4G12 April 2016

How many translated copies of a shape can overlap it and not each other?

From playlist G4G12 Videos

Video thumbnail

Live CEOing Ep 173: Geometry in Wolfram Language

Watch Stephen Wolfram and teams of developers in a live, working, language design meeting. This episode is about Geometry in the Wolfram Language.

From playlist Behind the Scenes in Real-Life Software Design

Video thumbnail

!!Con 2017: Islamic Geometry: Hankin’s Polygons in Contact Algorithm!!! by Yomna Nasser

Islamic Geometry: Hankin’s Polygons in Contact Algorithm!!! by Yomna Nasser In this talk we will go over Hankin’s “Polygons in Contact” algorithm, a technique for generating common patterns encountered in Islamic geometry, and some variations on it. There will be an introduction to tiling

From playlist !!Con 2017

Video thumbnail

Inner and outer billiards in symplectic spaces - Sergei Tabachnikov

Joint IAS/Princeton University Symplectic Geometry Seminar Topic: Inner and outer billiards in symplectic spaces Speaker: Sergei Tabachnikov Affiliation: Pennsylvania State University Date: May 02, 2022 I shall present two billiard-like systems associated with a convex hypersurface in a

From playlist Mathematics

Video thumbnail

Class 15: General & Edge Unfolding

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This class begins with defining handles and holes, and the Gauss-Bonnet Theorem applied to convex polyhedra. Algorithms for zipper

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012

Video thumbnail

Illustrator Tutorial - Logo design fundamentals

Learn the fundamentals of logo design in Adobe Illustrator. Explore more Illustrator courses and advance your skills on LinkedIn Learning: https://www.linkedin.com/learning/topics/illustrator?trk=sme-youtube_M137450-06-03_learning&src=yt-other This is an excerpt from "Design Your First Lo

From playlist Adobe Illustrator

Video thumbnail

What is a concave polygon

👉 Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Lecture 15: General & Edge Unfolding

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture begins with describing polyhedron unfolding for convex and nonconvex polygons. Algorithms for shortest path solutions

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012

Video thumbnail

Foldable Polyhedron 1

Delta-Star is a polyhedral object which I invented in 1996. The type of Delta-Star corresponds to Deltahedrons. It expands and shrinks. Especially highly symmetric tetrahedron,octahedron,icosahedron types and hexahedron,decahedron types can transform smoothly.

From playlist Handmade geometric toys

Video thumbnail

Jiaoyang Huang (NYU) -- Height Fluctuations of Random Lozenge Tilings Through Nonintersecting RWs

In this talk, we will discuss global fluctuations of random lozenge tilings of polygonal domains. We study their height functions from a dynamical pointview, by identifying lozenge tilings with nonintersecting Bernoulli random walks. For a large class of polygons which have exactly one ho

From playlist Integrable Probability Working Group

Related pages

Big O notation | Visibility polygon | Star domain | Antiparallelogram | Set (mathematics) | Monotone polygon | Geometry | Convex polygon | Link distance | Lemoine hexagon | Star polygon