×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

computational geometry

A collection of 48 posts

Algorithms

Navigating the Vibrant Landscape of Chromatic Art Gallery Problems

In this insightful expedition at OpenGenus, we will traverse the complexities of guarding polygonal masterpieces, exploring its NP-hard intricacies and delving into variant landscapes that challenge the very essence of guarding with colors.

Rishabh Agarwal
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).

Joe Gorst Joe Gorst
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.

Joe Gorst Joe Gorst
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.

Joe Gorst Joe Gorst
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.

Joe Gorst Joe Gorst
computational geometry

Halfplane Intersection problem

In this article, we will be discussing how to compute the intersection of a set of halfplanes.

Joe Gorst Joe Gorst
computational geometry

Polygon Triangulation

In this article, we have explained the problem statement of Polygon Triangulation along with algorithmic approaches.

Joe Gorst Joe Gorst
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.

Joe Gorst Joe Gorst
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.

Joe Gorst Joe Gorst
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.

Joe Gorst Joe Gorst
computational geometry

Direction of point from line segment

In this article, we have explored algorithm to find the Direction of point from line segment.

Joe Gorst Joe Gorst
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.

Joe Gorst Joe Gorst
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.

Joe Gorst Joe Gorst
computational geometry

Map Overlay Problem

In this article, we will be exploring the Map Overlay Problem which is a core problem in Computational Geometry. We have explored simple variants of Map Overlay Problem.

Mohd Ehtesham Uddin Qureshi Mohd Ehtesham Uddin Qureshi
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.

Joe Gorst Joe Gorst
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.

Joe Gorst Joe Gorst
computational geometry

Art Gallery Problem

In this article, we have explored Art Gallery Problem in depth along with variants of Art Gallery Problem and important results.

Aravind Mohandas Aravind Mohandas
computational geometry

Check if 4 Line Segments form a Rectangle

In this article, we will solve the problem of Check if 4 Line Segments form a Rectangle. This is a core problem of Computational Geometry.

Aravind Mohandas Aravind Mohandas
computational geometry

Euler’s Polyhedron Formula

In this article, we have explored Euler’s Polyhedron Formula in depth with examples, proof and applications in real life problems.

Akanksha Singh
computational geometry

Find mirror image of point in 3D plane

In this article, we will learn how to find the mirror image of a point (x,y,z) in 3D-plane.

Kartik Keyan Kant Kartik Keyan Kant
Algorithms

Shortest distance between a Line and Point in 3D plane

In this article, we have presented two algorithms to find the Shortest distance between a Line and Point in 3D plane. This involves idea of Projection and Parallelogram.

Susmita Bhattacharya
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.

Joe Gorst Joe Gorst
Algorithms

Delaunay Triangulation

In this article, we discuss Delaunay Triangulation, its relation to Voronoi diagrams and algorithms to compute Delaunay Triangulation. This is an important topic in Computational Geometry.

Erick Lumunge
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.

Joe Gorst Joe Gorst
Algorithms

Number of Integral points inside a rectangle

In this article, we have explored an insightful approach/ algorithm to find the number of interior integral points of a rectangle. This is an important concept in the field of computational geometry.

Rohan Chandrashekar Rohan Chandrashekar
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship