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
Discrete geometry has a large overlap with convex geometry and computational geometry, and is closely related to subjects such as finite geometry, combinatorial...
15 KB (1,575 words) - 05:36, 16 October 2024
with a history stretching back to antiquity. Computational complexity is central to computational geometry, with great practical significance if algorithms...
15 KB (2,101 words) - 04:13, 7 April 2024
the emergence of applications of discrete geometry to computational geometry, these two fields partially merged and became a separate field of study....
32 KB (3,432 words) - 12:41, 6 November 2024
by letting f0(x) = 1 and letting fi(x), for i > 0, be the i-th coordinate of x. In discrete geometry and computational geometry, the ham sandwich theorem...
19 KB (2,711 words) - 09:20, 24 January 2025
Joseph (eds.), Handbook of Discrete and Computational Geometry, Discrete Mathematics and Its Applications (2nd ed.), Chapman and Hall/CRC Matoušek, Jiří;...
30 KB (3,579 words) - 11:39, 11 December 2024
Polyhedron (redirect from Polyhedron and Polyhedra)
"Realizations of regular abstract polyhedra of types {3,6} and {6,3}", Discrete and Computational Geometry, 24 (2–3): 241–255, doi:10.1007/s004540010030, MR 1758047...
97 KB (10,636 words) - 00:56, 3 March 2025
Triangle (redirect from Triangle (geometry))
in Discrete and Computational Geometry: Proceedings of the 1996 AMS-IMS-SIAM Joint Summer Research Conference, Discrete and Computational Geometry—Ten...
54 KB (6,460 words) - 06:10, 19 February 2025
Moser's worm problem (category Discrete geometry)
"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 (795 words) - 00:39, 18 October 2024
Happy ending problem (category Discrete geometry)
Discrete and Computational Geometry, 19 (3): 367–371, doi:10.1007/PL00009353 Erdős, P.; Szekeres, G. (1935), "A combinatorial problem in geometry",...
18 KB (1,879 words) - 22:55, 14 November 2024
model computer systems, and methods from discrete mathematics are used in analyzing VLSI electronic circuits. Computational geometry applies algorithms to...
26 KB (2,771 words) - 02:35, 23 December 2024
Károly Bezdek (section Early life and family)
a Canada Research Chair of mathematics and the director of the Centre for Computational and Discrete Geometry at the University of Calgary in Calgary...
17 KB (1,731 words) - 11:41, 29 December 2023
Uno, Yushi (eds.). Discrete and Computational Geometry and Graphs. Japanese Conference on Discrete and Computational Geometry and Graphs. Kyoto. doi:10...
25 KB (2,699 words) - 02:44, 3 March 2025
foundation of most modern fields of geometry, including algebraic, differential, discrete and computational geometry. Usually the Cartesian coordinate system...
40 KB (5,612 words) - 22:13, 23 December 2024
Honeycomb conjecture (category Discrete geometry)
Hales, Thomas C. (January 2001). "The Honeycomb Conjecture". Discrete and Computational Geometry. 25 (1): 1–22. arXiv:math/9906042. doi:10.1007/s004540010071...
4 KB (567 words) - 07:00, 5 January 2025
Discrete and Computational Geometry: Proceedings of the 1996 AMS-IMS-SIAM Joint Summer Research Conference, Discrete and Computational Geometry–Ten Years...
3 KB (307 words) - 17:41, 24 July 2024
Ronald Graham (category Fellows of the Society for Industrial and Applied Mathematics)
Labs and later at the University of California, San Diego. He did important work in scheduling theory, computational geometry, Ramsey theory, and quasi-randomness...
52 KB (4,467 words) - 18:59, 1 February 2025
János Pach (section Awards and honors)
mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry. Pach was born and grew up in Hungary...
15 KB (1,299 words) - 07:29, 13 September 2024
László Fejes Tóth (section Early life and career)
Kossuth Prize (1957) and State Award (1973). Together with H.S.M. Coxeter and Paul Erdős, he laid the foundations of discrete geometry. As described in a...
26 KB (2,552 words) - 20:58, 17 January 2025
Sauer–Shelah lemma (section Definitions and statement)
Shelah's was in model theory and that of Vapnik and Chervonenkis was in statistics. It has also been applied in discrete geometry and graph theory. If F = {...
17 KB (2,044 words) - 18:28, 28 February 2025
Godfried Toussaint (section Books and book chapters)
be the father of computational geometry in Canada. He did research on various aspects of computational geometry, discrete geometry, and their applications:...
10 KB (1,217 words) - 06:40, 27 September 2024
Straight skeleton (category Discrete geometry)
crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions". Discrete and Computational Geometry. 22 (4): 569–592...
20 KB (2,179 words) - 06:34, 29 August 2024
methods—differential geometry, algebraic geometry, computational geometry, algebraic topology, discrete geometry (also known as combinatorial geometry), etc.—or...
102 KB (10,057 words) - 20:39, 16 February 2025
book:[1] Computational Geometry in C, 2nd Ed. (1998). ISBN 978-0-521-64976-6 [2] Handbook of Discrete and Computational Geometry, with Jacob E. Goodman and Csaba...
6 KB (642 words) - 02:39, 25 January 2025
CGAL (redirect from Computational Geometry Algorithms Library)
The Computational Geometry Algorithms Library (CGAL) is an open source software library of computational geometry algorithms. While primarily written...
6 KB (547 words) - 11:16, 17 February 2025
Fréchet distance (category Metric geometry)
between polylines with applications to morphing and polygon sweeping" (PDF), Discrete and Computational Geometry, 28 (4): 535–569, doi:10.1007/s00454-002-2886-1...
16 KB (1,884 words) - 01:37, 31 January 2025
Vertex enumeration problem (category Discrete geometry)
pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra". Discrete and Computational Geometry. 8 (1): 295–313. doi:10.1007/BF02293050...
3 KB (379 words) - 18:49, 6 August 2022
Mathematics and Professor of Computer Science at the University of San Diego. His research concerns topology and geometry, mostly seen through a discrete and computational...
10 KB (804 words) - 03:57, 7 October 2024
Computational mathematics is the study of the interaction between mathematics and calculations done by a computer. A large part of computational mathematics...
6 KB (564 words) - 19:36, 31 October 2024
Carpenter's rule problem (category Discrete geometry)
The carpenter's rule problem is a discrete geometry problem, which can be stated in the following manner: Can a simple planar polygon be moved continuously...
6 KB (638 words) - 22:45, 2 March 2025