Steiner's Segment Problem
Given 
points, find the line segments with the shortest possible total length which connect the points. The segmentsneed not necessarily be straight from one point to another.
For three points, if all Angles are less than 120°, then the line segments are those connecting thethree points to a central point 
which makes the Angles 
, 
, and 
all120°. If one Angle is greater that 120°, then coincides with the offending Angle.
For four points, is the intersection of the two diagonals, but the required minimum segments are not necessarily thesediagonals.
A modified version of the problem is, given two points, to find the segments with the shortest total length connecting thepoints such that each branch point may be connected to only three segments. There is no general solution to this version ofthe problem.
- Circle Method
- Circle Negative Pedal Curve
- Circle Notation
- Circle Order
- Circle Orthotomic
- Circle Packing
- Circle Pedal Curve
- Circle-Point Midpoint Theorem
- Circle Radial Curve
- Circles-and-Squares Fractal
- Circle Squaring
- Circle Strophoid
- Circle Tangents
- Circuit
- Circuit Rank
- Circulant Determinant
- Circulant Graph
- Circulant Matrix
- Circular Cylindrical Coordinates
- Circular Functions
- Circular Permutation
- Circumcenter
- Circumcircle
- Circumference
- Circuminscribed