Related Research Articles
Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.
In computational geometry, polygon triangulation is the partition of a polygonal area P into a set of triangles, i.e., finding a set of triangles with pairwise non-intersecting interiors whose union is P.
A triangulation of a set of points in the Euclidean space is a simplicial complex that covers the convex hull of , and whose vertices belong to . In the plane, triangulations are made up of triangles, together with their edges and vertices. Some authors require that all the points of are vertices of its triangulations. In this case, a triangulation of a set of points in the plane can alternatively be defined as a maximal set of non-crossing edges between points of . In the plane, triangulations are special cases of planar straight-line graphs.
Markus Hendrik Overmars is a Dutch computer scientist and teacher of game programming known for his game development application GameMaker. GameMaker lets people create computer games using a drag-and-drop interface. He is the former head of the Center for Geometry, Imaging, and Virtual Environments at Utrecht University, in the Netherlands. This research center concentrates on computational geometry and its application in areas like computer graphics, robotics, geographic information systems, imaging, multimedia, virtual environments, and games.
Branko Grünbaum was a Croatian-born mathematician of Jewish descent and a professor emeritus at the University of Washington in Seattle. He received his Ph.D. in 1957 from Hebrew University of Jerusalem in Israel.
In computational geometry, the multiple line segment intersection problem supplies a list of line segments in the Euclidean plane and asks whether any two of them intersect (cross).
In geometry, visibility is a mathematical abstraction of the real-life notion of visibility.
Boolean operations on polygons are a set of Boolean operations operating on one or more sets of polygons in computer graphics. These sets of operations are widely used in computer graphics, CAD, and in EDA.
Joseph O'Rourke is the Spencer T. and Ann W. Olin Professor of Computer Science at Smith College and the founding chair of the Smith computer science department. His main research interest is computational geometry.
Victor Yakovlevich Pan is a Soviet and American mathematician and computer scientist, known for his research on algorithms for polynomials and matrix multiplication.
In geometry, a double wedge is the the symmetric difference of two half-spaces whose boundaries are not parallel to each other. For instance, in the Cartesian plane, the union of the positive and negative quadrants forms a double wedge, and more generally in two dimensions a double wedge consists of the set of points within two vertical angles defined by a pair of lines. In projective geometry double wedges are the projective duals of line segments.
Jean-Daniel Boissonnat is a French computer scientist, who works as a director of research at the French Institute for Research in Computer Science and Automation (INRIA). He is an invited professor of computational geometry at the Collège de France, holding the Chair in Informatics and Computational Sciences for 2016–2017.
Otfried Cheong is a German computational geometer working in South Korea at KAIST. He is known as one of the authors of the widely used computational geometry textbook Computational Geometry: Algorithms and Applications and as the developer of Ipe, a vector graphics editor.
The Greedy Triangulation is a method to compute a polygon triangulation or a Point set triangulation using a greedy schema, which adds edges one by one to the solution in strict increasing order by length, with the condition that an edge cannot cut a previously inserted edge.
In computational geometry, a Steiner point is a point that is not part of the input to a geometric optimization problem but is added during the solution of the problem, to create a better solution than would be possible from the original points alone.
Mariette Yvinec is a French researcher in computational geometry at the French Institute for Research in Computer Science and Automation (INRIA) in Sophia Antipolis. She is one of the developers of CGAL, a software library of computational geometry algorithms.
Clara Isabel Grima Ruiz is a professor of applied mathematics at the University of Seville, specializing in computational geometry. She is known for her research on scutoids and for her popularization of mathematics.
Mark de Berg is a Dutch computational geometer, known as one of the authors of the textbook Computational Geometry: Algorithms and Applications.
Algorithmic Geometry is a textbook on computational geometry. It was originally written in the French language by Jean-Daniel Boissonnat and Mariette Yvinec, and published as Géometrie algorithmique by Edusciences in 1995. It was translated into English by Hervé Brönnimann, with improvements to some proofs and additional exercises, and published by the Cambridge University Press in 1998.
References
- ↑ Reviews of Computational Geometry:
- Hecker, Hans-Dietrich (1998), Mathematical Reviews, doi:10.1007/978-3-662-03427-9, ISBN 978-3-662-03429-3, MR 1470713, S2CID 45679469
{{citation}}: CS1 maint: untitled periodical (link) - Giblin, Peter (March 2001), The Mathematical Gazette, 85 (502): 175–176, doi:10.2307/3620533, JSTOR 3620533, S2CID 126002833
{{citation}}: CS1 maint: untitled periodical (link)
- Hecker, Hans-Dietrich (1998), Mathematical Reviews, doi:10.1007/978-3-662-03427-9, ISBN 978-3-662-03429-3, MR 1470713, S2CID 45679469
- ↑ Marc van Kreveld at the Mathematics Genealogy Project
- ↑ Prof. dr. M.J. (Marc) van Kreveld, Utrecht University, retrieved 2019-07-31
- ↑ SoCG program committees , retrieved 2019-07-31
