query: How can I find incentre of a list of triangles?
positive_passages.docid: 158007
positive_passages.text: To inscribe a circle in a given triangle
negative_passages.docid: 57184
negative_passages.text: Find the point in a triangle minimizing the sum of distances to the vertices
negative_passages.docid: 72479
negative_passages.text: How to find all occurrences of an element in a list
negative_passages.docid: 99335
negative_passages.text: Sum of all triangle numbers
negative_passages.docid: 103172
negative_passages.text: showing certain vertices form an equilateral triangle
negative_passages.docid: 146746
negative_passages.text: A formula for the sum of the triangular numbers?
negative_passages.docid: 95232
negative_passages.text: How to convert many triangles to one mesh?
negative_passages.docid: 112896
negative_passages.text: Construct the triangle with given angle bisectors
negative_passages.docid: 117349
negative_passages.text: counting triangles in a graph or its complement
negative_passages.docid: 116547
negative_passages.text: How to create a neighboring list for a given triangulation and find the triangle and construct the tile?
negative_passages.docid: 87374
negative_passages.text: Python: Finding differences between elements of a list
negative_passages.docid: 153235
negative_passages.text: Checking for duplicates in sublists
negative_passages.docid: 4264
negative_passages.text: How to make a flat list out of a list of lists?
negative_passages.docid: 99202
negative_passages.text: What is the number of triangles with integer sides, given the length of the longest side?
negative_passages.docid: 95136
negative_passages.text: Finding center and radius of circumscribed triangle
negative_passages.docid: 139183
negative_passages.text: How can I prove the formula for calculating successive entries in a given row of Pascal's triangle?
negative_passages.docid: 13126
negative_passages.text: Visualize Pascal's triangle and other triangle shaped lists