Search Results for ""
141 - 150 of 8770 for Point Line Distance 3 DimensionalSearch Results
![](/common/images/search/spacer.gif)
Let T_1 be the point at which the J_1-excircle meets the side A_2A_3 of a triangle DeltaA_1A_2A_3, and define T_2 and T_3 similarly. Then the lines A_1T_1, A_2T_2, and A_3T_3 ...
The third Brocard point has triangle center function alpha=a^(-3) and is Kimberling center X_(76) (Kimberling 1998, p. 78). The point may have received its name since its ...
The intersection of two lines L_1 and L_2 in two dimensions with, L_1 containing the points (x_1,y_1) and (x_2,y_2), and L_2 containing the points (x_3,y_3) and (x_4,y_4), is ...
Members of a coaxal system satisfy x^2+y^2+2lambdax+c=(x+lambda)^2+y^2+c-lambda^2=0 for values of lambda. Picking lambda^2=c then gives the two circles (x+/-sqrt(c))^2+y^2=0 ...
The extangents triangle is homothetic to the orthic triangle, and its homothetic center is known as the Clawson point, or sometimes the "crucial point." It has equivalent ...
Weill's theorem states that, given the incircle and circumcircle of a bicentric polygon of n sides, the centroid of the tangent points on the incircle is a fixed point W, ...
A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...
A point p on a regular surface M in R^3 is said to be planar if the Gaussian curvature K(p)=0 and S(p)=0 (where S is the shape operator), or equivalently, both of the ...
A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...
A complex line bundle is a vector bundle pi:E->M whose fibers pi^(-1)(m) are a copy of C. pi is a holomorphic line bundle if it is a holomorphic map between complex manifolds ...
![](/common/images/search/spacer.gif)
...