Computational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.

The 8th Canadian conference on computational geometry had an international flavour. Sixty-one papers were submitted by authors from over 20 countries representing four continents. The conference was held at Carleton University in August 1996.

This book constitutes the thoroughly refereed post-conference proceedings of the 18th Japanese Conference on Discrete and Computational Geometry and Graphs, JDCDGG 2015, held in Kyoto, Japan, in September 2015. The total of 25 papers included in this volume was carefully reviewed and selected from 64 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics. This proceedings are dedicated to Naoki Katoh on the occasion of his retirement from Kyoto University.

Spatial data analysis is a fast growing area and Voronoi diagrams provide a means of naturally partitioning space into subregions to facilitate spatial data manipulation, modelling of spatial structures, pattern recognition and locational optimization. With such versatility, the Voronoi diagram and its relative, the Delaunay triangulation, provide valuable tools for the analysis of spatial data. This is a rapidly growing research area and in this fully updated second edition the authors provide an up-to-date and comprehensive unification of all the previous literature on the subject of Voronoi diagrams. Features: * Expands on the highly acclaimed first edition * Provides an up-to-date and comprehensive survey of the existing literature on Voronoi diagrams * Includes a useful compendium of applications * Contains an extensive bibliography A wide range of applications is discussed, enabling this book to serve as an important reference volume on this topic. The text will appeal to students and researchers studying spatial data in a number of areas, in particular, applied probability, computational geometry, and Geographic Information Science (GIS). This book will appeal equally to those whose interests in Voronoi diagrams are theoretical, practical or both.

The 9th issue of the Transactions on Computational Science journal, edited by François Anton, is devoted to the subject of Voronoi diagrams in science and engineering. The 9 papers included in the issue constitute extended versions of selected papers from the International Symposium on Voronoi Diagrams, held in Copenhagen, Denmark, June 23-36, 2009. Topics covered include: divide and conquer construction of Voronoi diagrams; new generalized Voronoi diagrams or properties of existing generalized Voronoi diagrams; and applications of Voronoi diagrams and their duals in graph theory, computer graphics, bioinformatics, and spatial process simulation.

Written by authors at the forefront of modern algorithms research, Delaunay Mesh Generation demonstrates the power and versatility of Delaunay meshers in tackling complex geometric domains ranging from polyhedra with internal boundaries to piecewise smooth surfaces. Covering both volume and surface meshes, the authors fully explain how and why thes

This book constitutes the proceedings of the 15th Latin American Symposium on Theoretical Informatics, LATIN 2022, which took place in Guanajuato, Mexico, in November 2022. The 46 papers presented in this volume were carefully reviewed and selected from 114 submissions. They were organized in topical sections as follows: Algorithms and Data Structures; Approximation Algorithms; Cryptography; Social Choice Theory; Theoretical Machine Learning; Automata Theory and Formal Languages; Combinatorics and Graph Theory; Complexity Theory; Computational Geometry. Chapter “Klee’s Measure Problem Made Oblivious” is available open access under a CC BY 4.0 license.