|
Ferran Hurtado
Ferran Hurtado Díaz (8 May 1951 – 2 October 2014) was a Spanish mathematician and computer scientist known for his research in computational geometry. Life Hurtado was born on 8 May 1951 in Valencia, Spain. He earned his Ph.D. degree from the Polytechnic University of Catalonia in Barcelona in 1993 under the supervision of Oriol Serra Albó; his dissertation was ''Problemas geométricos de visibilidad'' 'Geometric problems of visibility'' It won the ''Premio Extraordinario de Doctorado UPC'' in 1995. He became a professor at the Polytechnic University of Catalonia, and died on 2 October 2014 in Barcelona. Contributions Hurtado was a pioneer of Spanish computational geometry, and of connections between computational geometry and combinatorics. He is known, not only for his own research contributions to those subjects, but also for the questions he posed for others to solve. The topics of his research included flip graphs of polygon triangulations, Voronoi diagrams, visibility ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Valencia
Valencia ( va, València) is the capital of the Autonomous communities of Spain, autonomous community of Valencian Community, Valencia and the Municipalities of Spain, third-most populated municipality in Spain, with 791,413 inhabitants. It is also the capital of the Province of Valencia, province of the same name. The wider urban area also comprising the neighbouring municipalities has a population of around 1.6 million, constituting one of the List of coastal settlements of the Mediterranean Sea, major urban areas on the European side of the Mediterranean Sea. It is located on the banks of the Turia (river), Turia, on the east coast of the Iberian Peninsula, at the Gulf of Valencia, north of the Albufera lagoon. Valencia was founded as a Roman Republic, Roman colony in 138 BC. Al-Andalus, Islamic rule and acculturation ensued in the 8th century, together with the introduction of new irrigation systems and crops. Crown of Aragon, Aragonese Christian conquest took place in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Visibility (geometry)
In geometry, visibility is a mathematical abstraction of the real-life notion of visibility. Given a set of obstacles in the Euclidean space, two points in the space are said to be visible to each other, if the line segment that joins them does not intersect any obstacles. (In the Earth's atmosphere light follows a slightly curved path that is not perfectly predictable, complicating the calculation of actual visibility.) Computation of visibility is among the basic problems in computational geometry and has applications in computer graphics, motion planning, and other areas. Concepts and problems * Point visibility * Edge visibilityE. Roth, G. Panin and A. Knoll,Sampling feature points for contour tracking with graphics hardware, "In International Workshop on Vision, Modeling and Visualization (VMV)", Konstanz, Germany, October 2008. * Visibility polygon * Weak visibility *Art gallery problem or museum problem *Visibility graph ** Visibility graph of vertical line segments * Wat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spanish Computer Scientists
Spanish might refer to: * Items from or related to Spain: **Spaniards are a nation and ethnic group indigenous to Spain **Spanish language, spoken in Spain and many Latin American countries **Spanish cuisine Other places * Spanish, Ontario, Canada * Spanish River (other), the name of several rivers * Spanish Town, Jamaica Other uses * John J. Spanish (1922–2019), American politician * Spanish (song), "Spanish" (song), a single by Craig David, 2003 See also * * * Español (other) * Spain (other) * España (other) * Espanola (other) * Hispania, the Roman and Greek name for the Iberian Peninsula * Hispanic, the people, nations, and cultures that have a historical link to Spain * Hispanic (other) * Hispanism * Spain (other) * National and regional identity in Spain * Culture of Spain * Spanish Fort (other) {{disambiguation, geo Language and nationality disambiguation pages ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
2014 Deaths
This is a list of deaths of notable people, organised by year. New deaths articles are added to their respective month (e.g., Deaths in ) and then linked here. 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 See also * Lists of deaths by day The following pages, corresponding to the Gregorian calendar, list the historical events, births, deaths, and holidays and observances of the specified day of the year: Footnotes See also * Leap year * List of calendars * List of non-standard ... * Deaths by year {{DEFAULTSORT:deaths by year ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1951 Births
Events January * January 4 – Korean War: Third Battle of Seoul – Chinese and North Korean forces capture Seoul for the second time (having lost the Second Battle of Seoul in September 1950). * January 9 – The Government of the United Kingdom announces abandonment of the Tanganyika groundnut scheme for the cultivation of peanuts in the Tanganyika Territory, with the writing off of £36.5M debt. * January 15 – In a court in West Germany, Ilse Koch, The "Witch of Buchenwald", wife of the commandant of the Buchenwald concentration camp, is sentenced to life imprisonment. * January 20 – Winter of Terror: Avalanches in the Alps kill 240 and bury 45,000 for a time, in Switzerland, Austria and Italy. * January 21 – Mount Lamington in Papua New Guinea erupts catastrophically, killing nearly 3,000 people and causing great devastation in Oro Province. * January 25 – Dutch author Anne de Vries releases the first volume of his children's novel '' Journey Through ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SIGACT News
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer. Publications SIGACT publishes a quarterly print newsletter, ''SIGACT News''. Its online version, ''SIGACT News Online'', is available since 1996 for SIGACT members, with unrestricted access to some features. Conferences SIGACT sponsors or has sponsored several annual conferences. *COLT: Conference on Learning Theory, until 1999 *PODC: ACM Symposium on Principles of Distributed Computing (jointly sponsored by SIGOPS) *PODS: ACM Symposium on Principles of Database Systems *POPL: ACM Symposium on Principles of Programming Languages *SOCG: ACM Symposium on Computational Geometry (jointly sponsored by SIGGRAPH), until 2014 *SODA: ACM/SIAM Symposium on Discrete Algorithms (jointly sponsored by the Society for Industrial and Applied Mathematics). T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Geometry (journal)
''Computational Geometry'', also known as ''Computational Geometry: Theory and Applications'', is a peer-reviewed mathematics journal for research in theoretical and applied computational geometry, its applications, techniques, and design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects, as well as fundamental problems in various areas of application of computational geometry: in computer graphics, pattern recognition, image processing, robotics, electronic design automation, CAD/CAM, and geographical information systems. The journal was founded in 1991 by Jörg-Rüdiger Sack and Jorge Urrutia.. It is indexed by ''Mathematical Reviews'', Zentralblatt MATH, Science Citation Index, and Current Contents ''Current Contents'' is a rapid alerting service database from Clarivate Analytics, formerly the Institute for Scientific Information and Thomson Reuters. It is publis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometric Graph Theory
Geometric graph theory in the broader sense is a large and amorphous subfield of graph theory, concerned with graphs defined by geometric means. In a stricter sense, geometric graph theory studies combinatorial and geometric properties of geometric graphs, meaning graphs drawn in the Euclidean plane with possibly intersecting straight-line edges, and topological graphs, where the edges are allowed to be arbitrary continuous curves connecting the vertices, thus it is "the theory of geometric and topological graphs" (Pach 2013). Geometric graphs are also known as spatial networks. Different types of geometric graphs A ''planar straight-line graph'' is a graph in which the vertices are embedded as points in the Euclidean plane, and the edges are embedded as non-crossing line segments. Fáry's theorem states that any planar graph may be represented as a planar straight line graph. A triangulation is a planar straight line graph to which no more edges may be added, so called bec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Happy Ending Problem
In mathematics, the "happy ending problem" (so named by Paul Erdős because it led to the marriage of George Szekeres and Esther Klein) is the following statement: This was one of the original results that led to the development of Ramsey theory. The happy ending theorem can be proven by a simple case analysis: if four or more points are vertices of the convex hull, any four such points can be chosen. If on the other hand, the convex hull has the form of a triangle with two points inside it, the two inner points and one of the triangle sides can be chosen. See for an illustrated explanation of this proof, and for a more detailed survey of the problem. The Erdős–Szekeres conjecture states precisely a more general relationship between the number of points in a general-position point set and its largest subset forming a convex polygon, namely that the smallest number of points for which any general position arrangement contains a convex subset of n points is 2^ + 1. It r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simple Polygon
In geometry, a simple polygon is a polygon that does not Intersection (Euclidean geometry), intersect itself and has no holes. That is, it is a flat shape consisting of straight, non-intersecting line segments or "sides" that are joined pairwise to form a single closed curve, closed path. If the sides intersect then the polygon is not simple. The qualifier "simple" is frequently omitted, with the above definition then being understood to define a polygon in general. The definition given above ensures the following properties: * A polygon encloses a region (mathematics), region (called its interior) which always has a measurable area. * The line segments that make up a polygon (called sides or edges) meet only at their endpoints, called vertices (singular: vertex) or less formally "corners". * Exactly two edges meet at each vertex. * The number of edges always equals the number of vertices. Two edges meeting at a corner are usually required to form an angle that is not straight ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Voronoi Diagram
In mathematics, a Voronoi diagram is a partition of a plane into regions close to each of a given set of objects. In the simplest case, these objects are just finitely many points in the plane (called seeds, sites, or generators). For each seed there is a corresponding region, called a Voronoi cell, consisting of all points of the plane closer to that seed than to any other. The Voronoi diagram of a set of points is dual to that set's Delaunay triangulation. The Voronoi diagram is named after mathematician Georgy Voronoy, and is also called a Voronoi tessellation, a Voronoi decomposition, a Voronoi partition, or a Dirichlet tessellation (after Peter Gustav Lejeune Dirichlet). Voronoi cells are also known as Thiessen polygons. Voronoi diagrams have practical and theoretical applications in many fields, mainly in science and technology, but also in visual art. The simplest case In the simplest case, shown in the first picture, we are given a finite set of points in the Euclidean p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
