Search results
The page '"Discrete and Computational Geometry"' does not exist; did you mean "Discrete and Computational Geometry"? If not, you can create a draft and submit it for review or request that a redirect be created, but consider checking the search results below to see whether the topic is already covered.
- Discrete & Computational Geometry (redirect from 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...3 KB (166 words) - 03:09, 3 May 2024
computer scientist working in the fields of combinatorics and discrete and computational geometry. Pach was born and grew up in Hungary. He comes from a noted...15 KB (1,299 words) - 07:29, 13 September 2024
the IBM Almaden Research Center, and co-editor-in-chief of Discrete and Computational Geometry and of the Journal of Computational Geometry. Clarkson received...6 KB (543 words) - 07:26, 13 September 2024
Graham, R.L. (1998), "Forced convex n-gons in the plane", Discrete and Computational Geometry, 19 (3): 367–371, doi:10.1007/PL00009353 Erdős, P.; Szekeres...18 KB (1,899 words) - 13:18, 31 July 2024
"Odd crossing number and crossing number are not the same", Discrete and Computational Geometry, 39 (1–3): 442–454, doi:10.1007/s00454-008-9058-x A preliminary...30 KB (3,579 words) - 07:36, 18 July 2024
University of Mexico (UNAM). His research primarily concerns discrete and computational geometry. Urrutia earned his Ph.D. from the University of Waterloo...6 KB (478 words) - 05:49, 12 January 2024
sweeping visibility complexes via pseudotriangulations", Discrete and Computational Geometry, 16 (4): 419–453, doi:10.1007/BF02712876, MR 1414964. Pocchiola...19 KB (2,041 words) - 06:48, 17 August 2024- 2008). "Generating All Vertices of a Polyhedron Is Hard". Discrete and Computational Geometry. 39 (1–3): 174–190. doi:10.1007/s00454-008-9050-5. David...3 KB (379 words) - 18:49, 6 August 2022
- Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of...32 KB (3,441 words) - 08:19, 6 August 2024
- in Discrete and Computational Geometry: Proceedings of the 1996 AMS-IMS-SIAM Joint Summer Research Conference, Discrete and Computational Geometry–Ten...3 KB (307 words) - 17:41, 24 July 2024
- pancake sorting. Goodman co-edited the book Handbook of Discrete and Computational Geometry with Joseph O'Rourke. In 1999, Goodman returned to an old...9 KB (684 words) - 18:13, 31 July 2024
Casey Mann is an American mathematician, specializing in discrete and computational geometry, in particular tessellation and knot theory. He is Professor...4 KB (338 words) - 09:21, 7 July 2023
collection of original research papers in discrete and computational geometry entitled Discrete and Computational Geometry: The Goodman–Pollack Festschrift was...10 KB (827 words) - 11:27, 18 July 2024- In discrete and computational geometry, a set of points in the Euclidean plane or a higher-dimensional Euclidean space is said to be in convex position...5 KB (545 words) - 10:14, 18 December 2023
- In mathematical measure theory, for every positive integer n the ham sandwich theorem states that given n measurable "objects" in n-dimensional Euclidean...19 KB (2,453 words) - 22:21, 10 September 2024
- ISBN 0-521-64976-5. Satyan Devadoss; Joseph O'Rourke (2011). Discrete and Computational Geometry. Princeton University Press. ISBN 978-0-691-14553-2. Jim...19 KB (1,939 words) - 14:23, 28 June 2024
- Joseph O'Rourke, Devadoss is a coauthor of the textbook Discrete and Computational Geometry (Princeton University Press, 2011). With Matt Harvey, he...10 KB (774 words) - 05:01, 19 January 2024
geometry. Akiyama is a founder of the Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3), the founding managing editor...4 KB (423 words) - 07:38, 11 February 2023- "An improved upper bound for Leo Moser's worm problem", Discrete and Computational Geometry, 29 (3): 409–417, doi:10.1007/s00454-002-0774-3, MR 1961007...7 KB (784 words) - 09:52, 2 June 2024
O'Rourke Discrete and Computational Geometry. Princeton University Press, 2011, p. 60. Devadoss, O'Rourke Discrete and Computational Geometry. Princeton...12 KB (1,156 words) - 07:46, 18 July 2024
- Aronov, Saugata Basu, Janos Pach, Micha Sharir, editors, Discrete and Computational Geometry, Springer,, page 425: The generation of combinatorial types
- (2008). "Generating all vertices of a polyhedron is hard". Discrete and Computational Geometry. 39: 174–190. doi:10.1007/s00454-008-9050-5. ISSN 0179-5376