Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Triangle
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Figures circumscribed about a triangle === {{multiple image | total_width = 400 | image1 = Tangential triangle.svg | image2 = Steiner ellipse.svg | footer = The circumscribed circle tangent to a triangle and the [[Steiner circumellipse]] }} The [[tangential triangle]] of a reference triangle (other than a right triangle) is the triangle whose sides are on the [[tangent line]]s to the reference triangle's circumcircle at its vertices.<ref>{{cite journal|last1=Smith |first1=Geoff |last2=Leversha |first2=Gerry |title=Euler and triangle geometry |journal=Mathematical Gazette |volume=91 |date=November 2007 |issue=522 |pages=436β452 |doi=10.1017/S0025557200182087 |jstor=40378417}}</ref> As mentioned above, every triangle has a unique circumcircle, a circle passing through all three vertices, whose center is the intersection of the perpendicular bisectors of the triangle's sides. Furthermore, every triangle has a unique [[Steiner ellipse|Steiner circumellipse]], which passes through the triangle's vertices and has its center at the triangle's centroid. Of all ellipses going through the triangle's vertices, it has the smallest area.<ref>{{cite journal|first=John R. |last=Silvester |title=Extremal area ellipses of a convex quadrilateral |journal=The Mathematical Gazette |volume=101 |number=550 |date=March 2017 |pages=11β26 |doi=10.1017/mag.2017.2 }}</ref> The [[Kiepert hyperbola]] is unique [[conic]] that passes through the triangle's three vertices, its centroid, and its circumcenter.<ref>{{cite journal |last1=Eddy |first1=R. H. |last2=Fritsch |first2=R. |title=The Conics of Ludwig Kiepert: A Comprehensive Lesson in the Geometry of the Triangle |journal=Mathematics Magazine |date=1994 |volume=67 |issue=3 |pages=188β205|doi=10.1080/0025570X.1994.11996212 }}</ref> Of all triangles contained in a given [[convex polygon]], one with maximal area can be found in linear time; its vertices may be chosen as three of the vertices of the given polygon.{{sfn|Chandran|Mount|1992}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)