Barycentric Coordinates -- from Wolfram MathWorld



Barycentric Coordinates

Barycentric coordinates are triples of numbers (t_1,t_2,t_3) corresponding to masses placed at the vertices of a reference triangle DeltaA_1A_2A_3. These masses then determine a point P, which is the geometric centroid of the three masses and is identified with coordinates (t_1,t_2,t_3). The vertices of the triangle are given by (1,0,0), (0,1,0), and (0,0,1). Barycentric coordinates were discovered by Möbius in 1827 (Coxeter 1969, p. 217; Fauvel et al. 1993).

Barycentric

To find the barycentric coordinates for an arbitrary point P, find t_2 and t_3 from the point Q at the intersection of the line A_1P with the side A_2A_3, and then determine t_1 as the mass at A_1 that will balance a mass t_2+t_3 at Q, thus making P the centroid (left figure). Furthermore, the areas of the triangles DeltaA_1A_2P, DeltaA_1A_3P, and DeltaA_2A_3P are proportional to the barycentric coordinates t_3, t_2, and t_1 of P (right figure; Coxeter 1969, p. 217).

Barycentric coordinates are homogeneous, so

 (t_1,t_2,t_3)=(mut_1,mut_2,mut_3)
(1)

for mu!=0.

Barycentric coordinates normalized so that they become the actual areas of the subtriangles are called homogeneous barycentric coordinates. Barycentric coordinates normalized so that

 t_1+t_2+t_3=1,
(2)

so that the coordinates give the areas of the subtriangles normalized by the area of the original triangle are called areal coordinates (Coxeter 1969, p. 218). Barycentric and areal coordinates can provide particularly elegant proofs of geometric theorems such as Routh's theorem, Ceva's theorem, and Menelaus' theorem (Coxeter 1969, pp. 219-221).


Read full article from Barycentric Coordinates -- from Wolfram MathWorld


No comments:

Post a Comment

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts