- published: 03 Jun 2012
- views: 18907
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object.
Discrete geometry has large overlap with convex geometry and computational geometry, and is closely related to subjects such as finite geometry, combinatorial optimization, digital geometry, discrete differential geometry, geometric graph theory, toric geometry, and combinatorial topology.
Although polyhedra and tessellations had been studied for many years by people such as Kepler and Cauchy, modern discrete geometry has its origins in the late 19th century. Early topics studied were: the density of circle packings by Thue, projective configurations by Reye and Steinitz, the geometry of numbers by Minkowski, and map colourings by Tait, Heawood, and Hadwiger.
(For more information, see: http://keenan.is/here) The world around us is full of shapes: airplane wings and cell phones, brain tumors and rising loaves of bread, fossil records and freeform architectural surfaces. To a large extent, our ability to master these domains is limited by our capacity to design, process, and analyze geometry. But like much of mathematics, geometry makes liberal use of infinity -- a concept that is alien to machines with finite memory and limited precision. The driving force behind discrete differential geometry (DDG) is to develop a language that can be easily understood by a computer, yet still faithfully captures the way shape behaves in nature. A valuable consequence of constructing algorithmic descriptions is that real-world phenomena like "curvature" and "...
Sofien Bouaziz, Mario Deuss, Yuliy Schwartzburg, Thibaut Weise, Mark Pauly Symposium on Geometry Processing 2012 Abstract: We introduce a unified optimization framework for geometry processing based on shape constraints. These constraints preserve or prescribe the shape of subsets of the points of a geometric data set, such as polygons, one-ring cells, volume elements, or feature curves. Our method is based on two key concepts: a shape proximity function and shape projection operators. The proximity function encodes the distance of a desired least-squares fitted elementary target shape to the corresponding vertices of the 3D model. Projection operators are employed to minimize the proximity function by relocating vertices in a minimal way to match the imposed shape constraints. We demon...
Discrete geometry Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects.Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. =======Image-Copyright-Info======= Image is in public domain Author-Info: David Eppstein at English Wikipedia Image Source: https://en.wikipedia.org/wiki/File:Unit_disk_graph.svg =======Image-Copyright-Info======== -Video is targeted to blind users Attribution: Article text available under CC-BY-SA image source in video https://www.youtube.com/watch?v=ZsrpAQvwZLY
On the 60th anniversary of the Mathematics Department: Meeting on Discrete Geometry, Representations and Categories. January 28-30, 2014. Cali - Colombia This academic event will be held during January 28 - 30, 2014 in Cali, Colombia, within the framework of the 60th anniversary of the Mathematics Department.
Benjamin Matschke Technical University of Berlin; Member, School of Mathematics September 23, 2011 For more videos, visit http://video.ias.edu
This is a demo video for the following paper: Wuyuan Xie, Yunbo Zhang, Charlie C.L. Wang, and Ronald C.-K. Chung, "Surface-from-Gradients: An approach based on discrete geometry processing", 2014 IEEE Conference on Computer Vision and Pattern Recognition, Columbus, Ohio, June 24-27, 2014.
On discrete geometry problems, Курс: Конференция Abel in Saint-Petersburg, Лектор: Endre Szemeredi, Организаторы: Лекторий ФМЛ 239 Смотрите это видео на Лекториуме: https://lektorium.tv/lecture/15200 Лекция прошла в рамках Абелевской конференции для школьников. Другие курсы на эту тему доступны тут https://lektorium.tv/medialibrary Подписывайтесь на канал: http://www.youtube.com/channel/UCxAGkrJYNlpC1jfnJvE_6Lw Следите за новостями: https://vk.com/openlektorium https://www.facebook.com/groups/Lektorium/