computational geometry Bentley Ottmann Algorithm for Plane Sweeping In this article, we shall be discussing the Bentley-Ottmann algorithm for computing a plane sweep. This lists all the intersection points in a set of line segments. The Bentley-Ottmann algorithm takes O((n+k)logn).
computational geometry Monotone Chain algorithm for Convex Hull In this article, we have explored Monotone Chain algorithm for finding Convex Hull in a given set of points.
computational geometry Fixed Radius Near Neighbor Problem In this article, we will be tackling the fixed radius nearest neighbor problem, this is a variation on a nearest neighbor search.
computational geometry Point on a line with minimum sum distance from set of points In this article, we will be discussing how to find the geometric median, this is, the point on a line with the minimum sum distance from a set of points.
computational geometry Halfplane Intersection problem In this article, we will be discussing how to compute the intersection of a set of halfplanes.
computational geometry Polygon Triangulation In this article, we have explained the problem statement of Polygon Triangulation along with algorithmic approaches.
computational geometry Applications of Computational Geometry In this article, we have explained Applications of Computational Geometry along with topics/ algorithms used to solve a specific problem.
computational geometry Section formula In this article, we have explored the Section formula in Computational Geometry which deals with straight lines getting divided in a given ratio. This is an important concept.
computational geometry Introduction to Trigonometry In this article, we have explored the basic concepts of Trigonometry. These concepts are important for the Mathematics required for Computational Geometry.
computational geometry Direction of point from line segment In this article, we have explored algorithm to find the Direction of point from line segment.
computational geometry 3D Geometry: Mathematics for Computational Geometry In this article, we have covered the Mathematics of 3D Geometry for Computational Geometry. This involve the exploration of different 3D shapes along with area and volume of each shape.
computational geometry Check if line intersects circle In this article, we have explained how to check if line intersects circle and have provided three mathematical proofs along with implementation.
computational geometry Mathematics for Computational Geometry: Circle Theorems, Polygon In this article, we have covered Mathematics for Computational Geometry focused on 2D Shapes such as Circle properties/ theorems, Polygons and more.
computational geometry Mathematics for Computational Geometry: Points, Lines, Angles, Circle, Triangle In this article, we have explored the basics of Mathematics for Computational Geometry including Points, Lines, Angles, Circle, Triangle and other topics.
Compiler Design Lazy code motion in Compiler Design In this article, we will cover the basics of lazy code motion in compiler design. This is the idea of reducing redundant calculations or code size, saving resources or other optimizations.
Compiler Design Constant Propagation in Compiler Design In this article, we have explored Global Constant Propagation in Compiler Design in depth including compiler principles such as Global Code Analysis.
Compiler Design Code Generation in Compiler Design In this article, we have explored Code Generation in Compiler Design in depth including challenges and key techniques like Instruction Selection, Register Allocation using Graph Coloring, Instruction Ordering and much more.
Algorithms Furthest Pair of Points (+ Rotating Calipers Method) In this article, we have explained how to solve the problem of Furthest Pair of Points using Rotating Calipers Method. We have presented the naive approach as well.
Compiler Design Different Code Optimizations in Compiler Design In this article, we have listed and explained Different Code Optimizations in Compiler Design such as Peephole optimization, loop unrolling, Loop-invariant code motion and much more.
Algorithms Closest Pair of Points In this article, we have explored different algorithms using which we can find the Closest Pair of Points in a given set of N points efficiently in O(N logN) time. This involves the idea of Divide and Conquer.
Algorithms List of Randomized Algorithms In this article, we have listed several important Randomized Algorithms such as Fisher Yates shuffle, Minimum Cut with Karger's, Matrix Product Verification and many more.
Algorithms Reservoir Sampling Technique In this article, we have explained the Reservoir Sampling Technique which is the basis of Randomized Algorithms. We have covered two methods Simple Reservoir and Variable Probability.
Time Complexity Time & Space Complexity of Dijkstra's Algorithm In this article, we have explored the Time & Space Complexity of Dijkstra's Algorithm including 3 different variants like naive implementation, Binary Heap + Priority Queue and Fibonacci Heap + Priority Queue.
Algorithms Substring with Concatenation of All Words In this article, we have explained two approaches to solve the problem Substring with Concatenation of All Words. This involves the idea of Hash Map and Two Pointer.
Algorithms 2 Sum Closest: Find 2 elements with sum closest to target We have explained how to solve the 2 Sum Closest problem that is Find 2 elements with sum closest to a target efficiently. We have explained 3 different approaches which involves the use of Binary Search and Two Pointer technique.
