International Conference on Discrete and Computational Geometry

This track focuses on recent developments in discrete geometry, exploring the interplay between combinatorial structures and geometric properties. Contributions may include new theorems, conjectures, and applications in various mathematical contexts.

This session will cover innovative algorithms and computational methods in geometry, emphasizing efficiency and practicality. Topics include geometric intersection problems, Voronoi diagrams, and spatial data structures.

This track invites papers that investigate the connections between graph theory and discrete geometry. Topics may include graph embeddings, geometric representations of graphs, and applications in network analysis.

This session will explore algorithmic approaches to geometric modeling, focusing on both theoretical foundations and practical implementations. Contributions may address issues such as surface reconstruction, mesh generation, and shape optimization.

This track aims to highlight the combinatorial aspects of geometric structures, including arrangements, configurations, and incidence geometry. Papers may explore both classical results and contemporary advancements in this area.

This session will delve into the properties and applications of convex sets and functions in discrete and computational geometry. Topics may include convex hull algorithms, geometric inequalities, and optimization problems.

This track focuses on the study of polyhedra, including their geometric properties and combinatorial structures. Contributions may explore topics such as polyhedral combinatorics, duality, and applications in optimization.

This session will examine the role of geometric algorithms in the design and analysis of data structures. Topics may include spatial indexing, nearest neighbor search, and efficient storage of geometric information.

This track will explore the integration of topological methods within discrete and computational geometry. Contributions may address topics such as topological data analysis, simplicial complexes, and their geometric implications.

This session will focus on optimization problems that arise in geometric settings, including both theoretical and applied perspectives. Topics may include geometric optimization algorithms, resource allocation, and spatial planning.

This track will explore the role of visualization in understanding and presenting geometric concepts and data. Contributions may include novel visualization techniques, applications in education, and tools for geometric analysis.