|
Bitangent
In geometry, a bitangent to a curve is a line that touches in two distinct points and and that has the same direction as at these points. That is, is a tangent line at and at . Bitangents of algebraic curves In general, an algebraic curve will have infinitely many secant lines, but only finitely many bitangents. Bézout's theorem implies that an algebraic plane curve with a bitangent must have degree at least 4. The case of the 28 bitangents of a quartic was a celebrated piece of geometry of the nineteenth century, a relationship being shown to the 27 lines on the cubic surface. Bitangents of polygons The four bitangents of two disjoint convex polygons may be found efficiently by an algorithm based on binary search in which one maintains a binary search pointer into the lists of edges of each polygon and moves one of the pointers left or right at each steps depending on where the tangent lines to the edges at the two pointers cross each other. This bitangent calculati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tangent Lines To Two Circles
In Euclidean plane geometry, a tangent line to a circle is a line that touches the circle at exactly one point, never entering the circle's interior. Tangent lines to circles form the subject of several theorems, and play an important role in many geometrical constructions and proofs. Since the tangent line to a circle at a point is perpendicular to the radius to that point, theorems involving tangent lines often involve radial lines and orthogonal circles. Tangent lines to one circle A tangent line to a circle intersects the circle at a single point . For comparison, secant lines intersect a circle at two points, whereas another line may not intersect a circle at all. This property of tangent lines is preserved under many geometrical transformations, such as scalings, rotation, translations, inversions, and map projections. In technical language, these transformations do not change the incidence structure of the tangent line and circle, even though the line and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bitangents Of A Quartic
In the theory of algebraic plane curves, a general quartic plane curve has 28 bitangent lines, lines that are tangent to the curve in two places. These lines exist in the complex projective plane, but it is possible to define quartic curves for which all 28 of these lines have real numbers as their coordinates and therefore belong to the Euclidean plane. An explicit quartic with twenty-eight real bitangents was first given by As Plücker showed, the number of real bitangents of any quartic must be 28, 16, or a number less than 9. Another quartic with 28 real bitangents can be formed by the locus of centers of ellipses with fixed axis lengths, tangent to two non-parallel lines. gave a different construction of a quartic with twenty-eight bitangents, formed by projecting a cubic surface; twenty-seven of the bitangents to Shioda's curve are real while the twenty-eighth is the line at infinity in the projective plane. Example The Trott curve, another curve with 28 real bitangents, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Malfatti Circles
In geometry, the Malfatti circles are three circles inside a given triangle such that each circle is tangent to the other two and to two sides of the triangle. They are named after Gian Francesco Malfatti, who made early studies of the problem of constructing these circles in the mistaken belief that they would have the largest possible total area of any three disjoint circles within the triangle. Malfatti's problem has been used to refer both to the problem of constructing the Malfatti circles and to the problem of finding three area-maximizing circles within a triangle. A simple construction of the Malfatti circles was given by , and many mathematicians have since studied the problem. Malfatti himself supplied a formula for the radii of the three circles, and they may also be used to define two triangle centers, the Ajima–Malfatti points of a triangle. The problem of maximizing the total area of three circles in a triangle is never solved by the Malfatti circles. Instead, the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Visibility Graph
In computational geometry and robot motion planning, a visibility graph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane. Each node in the graph represents a point location, and each edge represents a visible connection between them. That is, if the line segment connecting two locations does not pass through any obstacle, an edge is drawn between them in the graph. When the set of locations lies in a line, this can be understood as an ordered series. Visibility graphs have therefore been extended to the realm of time series analysis. Applications Visibility graphs may be used to find Euclidean shortest paths among a set of polygonal obstacles in the plane: the shortest path between two obstacles follows straight line segments except at the vertices of the obstacles, where it may turn, so the Euclidean shortest path is the shortest path in a visibility graph that has as its nodes the start and destination points and the ver ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Belt Problem
The belt problem is a mathematics problem which requires finding the length of a crossed belt that connects two circular pulleys with radius ''r''1 and ''r''2 whose centers are separated by a distance ''P''. The solution of the belt problem requires trigonometry and the concepts of the bitangent line, the vertical angle, and congruent angles. Solution Clearly triangles ACO and ADO are congruent right angled triangles, as are triangles BEO and BFO. In addition, triangles ACO and BEO are similar. Therefore angles CAO, DAO, EBO and FBO are all equal. Denoting this angle by \varphi (denominated in radians), the length of the belt is :CO + DO + EO + FO + \text CD + \text EF \,\! :=2r_1\tan(\varphi) + 2r_2\tan(\varphi) + (2\pi-2\varphi)r_1 + (2\pi-2\varphi)r_2 \,\! :=2(r_1+r_2)(\tan(\varphi) + \pi- \varphi) \,\! This exploits the convenience of denominating angles in radians that the length of an arc = the radius × the measure of the angle facing the arc. To find \varphi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pseudotriangulation
In Euclidean plane geometry, a pseudotriangle (''pseudo-triangle'') is the simply connected subset of the plane that lies between any three mutually tangent convex sets. A pseudotriangulation (''pseudo-triangulations'') is a partition of a region of the plane into pseudotriangles, and a pointed pseudotriangulation is a pseudotriangulation in which at each vertex the incident edges span an angle of less than π. Although the words "pseudotriangle" and "pseudotriangulation" have been used with various meanings in mathematics for much longer, the terms as used here were introduced in 1993 by Michel Pocchiola and Gert Vegter in connection with the computation of visibility relations and bitangents among convex obstacles in the plane. Pointed pseudotriangulations were first considered by Ileana Streinu (2000, 2005) as part of her solution to the carpenter's ruler problem, a proof that any simple polygonal path in the plane can be straightened out by a sequence of continuous motions. Ps ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetry Set
In geometry, the symmetry set is a method for representing the local symmetries of a curve, and can be used as a method for representing the shape of objects by finding the topological skeleton. The medial axis, a subset of the symmetry set is a set of curves which roughly run along the middle of an object. In 2 dimensions Let I \subseteq \mathbb be an open interval, and \gamma : I \to \mathbb^2 be a parametrisation of a smooth plane curve. The symmetry set of \gamma (I) \subset \mathbb^2 is defined to be the closure of the set of centres of circles tangent to the curve at at least two distinct points ( bitangent circles). The symmetry set will have endpoints corresponding to vertices of the curve. Such points will lie at cusp of the evolute In the differential geometry of curves, the evolute of a curve is the locus (mathematics), locus of all its Center of curvature, centers of curvature. That is to say that when the center of curvature of each point on a curve is draw ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dijkstra's Algorithm
Dijkstra's algorithm ( ) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. Dijkstra's algorithm finds the shortest path from a given source node to every other node. It can be used to find the shortest path to a specific destination node, by terminating the algorithm after determining the shortest path to the destination node. For example, if the nodes of the graph represent cities, and the costs of edges represent the distances between pairs of cities connected by a direct road, then Dijkstra's algorithm can be used to find the shortest route between one city and all other cities. A common application of shortest path algorithms is network routing protocols, most notably IS-IS (Intermediate System to Intermediate System) and OSPF (Open Shortest Path First). It is also employed as a subroutine in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete And Computational Geometry
'' Discrete & Computational Geometry'' is a peer-reviewed mathematics journal published quarterly by Springer. Founded in 1986 by Jacob E. Goodman and Richard M. Pollack, the journal publishes articles on discrete geometry and computational geometry. Abstracting and indexing The journal is indexed in: * ''Mathematical Reviews'' * ''Zentralblatt MATH'' * ''Science Citation Index'' * ''Current Contents'' Notable articles Two articles published in ''Discrete & Computational Geometry'', one by Gil Kalai in 1992 with a proof of a subexponential upper bound on the diameter of a polytope and another by Samuel Ferguson in 2006 on the Kepler conjecture on optimal three-dimensional sphere packing, earned their authors the Fulkerson Prize The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Journal Of Computational Geometry And Applications
The ''International Journal of Computational Geometry and Applications'' (IJCGA) is a bimonthly journal published since 1991, by World Scientific. It covers the application of computational geometry in design and analysis of algorithms, focusing on problems arising in various fields of science and engineering such as computer-aided geometry design (CAGD), operations research, and others. The current editors-in-chief are D.-T. Lee of the Institute of Information Science in Taiwan, and Joseph S. B. Mitchell from the Department of Applied Mathematics and Statistics in the State University of New York at Stony Brook. Abstracting and indexing * Current Contents/Engineering, Computing & Technology * ISI Alerting Services * Science Citation Index Expanded (also known as SciSearch) * CompuMath Citation Index * Mathematical Reviews * INSPEC * DBLP Bibliography Server * Zentralblatt MATH zbMATH Open, formerly Zentralblatt MATH, is a major reviewing service providing reviews and ab ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symposium On Computational Geometry
The International Symposium on Computational Geometry (SoCG) is an academic conference in computational geometry. Today its acronym is pronounced "sausage." It was founded in 1985, with the program committee consisting of David Dobkin, Joseph O'Rourke, Franco Preparata, and Godfried Toussaint; O'Rourke was the conference chair. The symposium was originally sponsored by the SIGACT and SIGGRAPH Special Interest Groups of the Association for Computing Machinery (ACM). It dissociated from the ACM in 2014, motivated by the difficulties of organizing ACM conferences outside the United States and by the possibility of turning to an open-access system of publication. Since 2015 the conference proceedings have been published by the Leibniz International Proceedings in Informatics Dagstuhl is a computer science research center in Germany, located in and named after a district of the town of Wadern, Merzig-Wadern, Saarland. Location Following the model of the mathematical center at Mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Computer And System Sciences
The ''Journal of Computer and System Sciences'' (JCSS) is a peer-reviewed scientific journal in the field of computer science. ''JCSS'' is published by Elsevier, and it was started in 1967. Many influential scientific articles have been published in ''JCSS''; these include five papers that have won the Gödel Prize The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Inter .... Its managing editor is Michael Segal. Notes References * * External links * Journal homepageScienceDirect accessDBLP information Computer science journals Elsevier academic journals {{compu-journal-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
