Geometric algorithms | Geometric intersection
The surface-to-surface intersection (SSI) need. is a basic workflow in computer-aided geometric design: Given two intersecting surfaces in R3, compute all parts of the intersection curve. If two surfaces intersect, the result will be a set of isolated points, a set of curves, a set of overlapping surfaces, or any combination of these cases. Because exact solutions can be found only for some special surface classes, approximation methods must be used for the general case. (Wikipedia).
Example showing where two surfaces intersect. Free ebook http://tinyurl.com/EngMathYT
From playlist Several Variable Calculus / Vector Calculus
When do vector functions intersect?
Free ebook http://tinyurl.com/EngMathYT Example discussing intersection of curves of two vector functions on one variable.
From playlist Engineering Mathematics
Intersection of Planes on Geogebra
In this video, we look at a strategy for finding the intersection of planes on Geogebra.
From playlist Geogebra
From playlist Intersection Theory
Square and Regular Hexagon Action: Challenge Problem
Link: https://www.geogebra.org/m/dxsNFYWQ
From playlist Geometry: Challenge Problems
Triangle Median: Challenge Problem
Link: https://www.geogebra.org/m/jESRWymr BGM: Andy Hunter
From playlist Geometry: Challenge Problems
Ex: Determine the Point of Intersection of a Plane and a Line.
This video explains how to determine the intersection point of a plane and a line. http://mathispower4u.com
From playlist Equations of Planes and Lines in Space
Determine a Vector Valued Function from the Intersection of Two Surfaces
This video explains how to represent the intersection of two surfaces as a vector valued function. http://mathispower4u.yolasite.com/
From playlist Vector Valued Function
Complex surfaces 2: Minimal surfaces
This talk is part of a series about complex surfaces, and explains what minimal surfaces are. A minimial surfaces is one that cannot be obtained by blowing up a nonsingular surfaces at a point. We explain why every surface is birational to a minimal nonsingular projective surface. We disc
From playlist Algebraic geometry: extra topics
Joel Hass - Lecture 3 - Algorithms and complexity in the theory of knots and manifolds - 20/06/18
School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects (http://geomschool2018.univ-mlv.fr/) Joel Hass (University of California at Davis, USA) Algorithms and complexity in the theory of knots and manifolds Abstract: These lectures will introduce algorithmic pro
From playlist Joel Hass - School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects
Intersections of tangent lines
Tough problem analyzing the behavior of the intersection of tangent lines to a circle
From playlist Geometry
Joshua Greene - On curves intersecting at most once
June 20, 2018 - This talk was part of the 2018 RTG mini-conference Low-dimensional topology and its interactions with symplectic geometry How many essential simple closed curves can you draw on a surface so that no two are homotopic and no two intersect more than once? I will discuss pro
From playlist 2018 RTG mini-conference on low-dimensional topology and its interactions with symplectic geometry I
The Polynomial Method and Applications From Finite Field Kakeya to Distinct Distances - Larry Guth
Larry Guth University of Toronto; Member, School of Mathematics April 22, 2011 For more videos, visit http://video.ias.edu
From playlist Mathematics
Unexpected Applications of Polynomials in Combinatorics - Larry Guth
Larry Guth Massachusetts Institute of Technology March 12, 2013 In 2007, Zeev Dvir shocked experts by giving a one-page proof of the finite field Kakeya problem. The new idea in the proof was to introduce high degree polynomials into a problem about points and lines. This idea has led to p
From playlist Mathematics
algebraic geometry 33 Rationality of cubic surfaces
This lecture is part of an online algebraic geometry course, based on chapter I of "Algebraic geometry" by Hartshorne. It gives two rather informal and incomplete arguments for why nonsingular cubic surfaces are rational.
From playlist Algebraic geometry I: Varieties
Lecture 12: Geometric Queries (CMU 15-462/662)
Full playlist: https://www.youtube.com/playlist?list=PL9_jI1bdZmz2emSh0UQ5iOdT2xRHFHL7E Course information: http://15462.courses.cs.cmu.edu/
From playlist Computer Graphics (CMU 15-462/662)
Joel Hass - Lecture 2 - Algorithms and complexity in the theory of knots and manifolds - 19/06/18
School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects (http://geomschool2018.univ-mlv.fr/) Joel Hass (University of California at Davis, USA) Algorithms and complexity in the theory of knots and manifolds Abstract: These lectures will introduce algorithmic pro
From playlist Joel Hass - School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects
Daniel Massart: Algebraic intersection on translation surfaces
CIRM HYBRID EVENT Recorded during the meeting "Teichmüller Theory: Classical, Higher, Super and Quantum " the October 09, 2020 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide ma
From playlist Dynamical Systems and Ordinary Differential Equations
Imaginary Numbers Are Real [Part 13: Riemann Surfaces]
Want to learn more or teach this series? Check out the Imaginary Numbers are Real Workbook: http://www.welchlabs.com/resources. Supporting Code: https://github.com/stephencwelch/Imaginary-Numbers-Are-Real Imaginary numbers are not some wild invention, they are the deep and natural result
From playlist Imaginary Numbers are Real
Intersection of circles and lines
Practice finding the intersection of a circle and a line
From playlist Geometry