Depth Crossings And Conflicts In Discrete Geometry
Download Depth Crossings And Conflicts In Discrete Geometry PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Depth Crossings And Conflicts In Discrete Geometry book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Depth, Crossings and Conflicts in Discrete Geometry
Author: Marek Sulovsk 'y
language: en
Publisher: Logos Verlag Berlin GmbH
Release Date: 2012
Discrete geometry has been among the fastest growing fields of mathematics in the last decades. One of the most fascinating objects studied in discrete geometry are k-sets. Not only are they extremely difficult to understand but they also play an important role in estimating the running time of several geometric algorithms. This thesis presents developments in three areas related to k-sets. First, it examines the circle containment problem of Urrutia and Neumann-Lara and reveals its relationships to geometric partitioning problems and centre regions. Next, it investigates k-sets in low dimensions and generalises the k-edge crossing identity of Andrzejak et al. to the sphere. Last, it studies conflict-free colourings of geometric hypergraphs and extends many results on this topic to more restrictive list colouring variants.
Handbook of Discrete and Computational Geometry
The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.
Forbidden Configurations in Discrete Geometry
Author: David Eppstein
language: en
Publisher: Cambridge University Press
Release Date: 2018-05-17
Unifies discrete and computational geometry by using forbidden patterns of points to characterize many of its problems.