Line–sphere intersection
In analytic geometry, a line and a sphere can intersect in three ways: 1.
* No intersection at all 2.
* Intersection in exactly one point 3.
* Intersection in two points. Methods for distinguishing
Sliver polygon
A Sliver Polygon, in the context of Geographic Information Systems (GIS), is a small polygon found in vector data that is an artifact of error rather than representing a real-world feature. They have
Multiple line segment intersection
In computational geometry, the multiple line segment intersection problem supplies a list of line segments in the Euclidean plane and asks whether any two of them intersect (cross). Simple algorithms
Intersection (geometry)
In geometry, an intersection is a point, line, or curve common to two or more objects (such as lines, curves, planes, and surfaces). The simplest case in Euclidean geometry is the line–line intersecti
Intersection curve
In geometry, an intersection curve is a curve that is common to two geometric objects. In the simplest case, the intersection of two non-parallel planes in Euclidean 3-space is a line. In general, an
Line–plane intersection
In analytic geometry, the intersection of a line and a plane in three-dimensional space can be the empty set, a point, or a line. It is the entire line if that line is embedded in the plane, and is th
Line–line intersection
In Euclidean geometry, the intersection of a line and a line can be the empty set, a point, or another line. Distinguishing these cases and finding the intersection have uses, for example, in computer
Thrackle
A thrackle is an embedding of a graph in the plane, such that each edge is a Jordan arcand every pair of edges meet exactly once. Edges may either meet at a common endpoint, or, if they have no endpoi
Sphere–cylinder intersection
In the theory of analytic geometry for real three-dimensional space, the curve formed from the intersection between a sphere and a cylinder can be a circle, a point, the empty set, or a special type o
Möller–Trumbore intersection algorithm
The Möller–Trumbore ray-triangle intersection algorithm, named after its inventors Tomas Möller and Ben Trumbore, is a fast method for calculating the intersection of a ray and a triangle in three dim
Surface-to-surface intersection problem
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 surfa
Crossing number (graph theory)
In graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a graph is planar if and only if its crossing number is
DE-9IM
The Dimensionally Extended 9-Intersection Model (DE-9IM) is a topological model and a standard used to describe the spatial relations of two regions (two geometries in two-dimensions, R2), in geometry