中文簡介

《離散與計(jì)算幾何》(DCG)是一本國際數(shù)學(xué)與計(jì)算機(jī)科學(xué)雜志，涵蓋了幾何在其中扮演著重要角色的廣泛主題。它出版幾何論文的主題如下-多邊形、空間細(xì)分、填充、覆蓋和平鋪、配置和排列以及幾何圖形;——幾何算法及其復(fù)雜性,凸殼,泰森多邊形法圖,德勞內(nèi)三角剖分,和搜索范圍;-立體建模、計(jì)算機(jī)圖形學(xué)、圖像處理、模式識(shí)別和運(yùn)動(dòng)規(guī)劃;-計(jì)算拓?fù)?，離散微分幾何，幾何概率，和真實(shí)代數(shù)幾何。該雜志還接受在圖論、數(shù)學(xué)編程、組合優(yōu)化、代數(shù)幾何、數(shù)字幾何、晶體學(xué)、數(shù)據(jù)分析、機(jī)器學(xué)習(xí)和機(jī)器人等領(lǐng)域具有獨(dú)特幾何風(fēng)格的論文。該雜志還鼓勵(lì)額外的材料，如短視頻，動(dòng)畫圖形，和類似的電子補(bǔ)充材料。

投稿網(wǎng)址：http://www.springer.com/journal/454/submission

英文簡介

Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role.It publishes geometric papers on such topics as- polytopes, spatial subdivision, packing, covering, and tiling, configurations and arrangements, and geometric graphs;- geometric algorithms and their complexity, convex hulls, Voronoi diagrams, Delaunay triangulation, and range searching;- solid modeling, computer graphics, image processing, pattern recognition, and motion planning;- computational topology, discrete differential geometry, geometric probability, and real algebraic geometry.The journal also accepts papers with a distinct geometric flavor in such areas as graph theory, mathematical programming, combinatorial optimization, algebraic geometry, geometry of numbers, crystallography, data analysis, machine learning, and robotics.The journal also encourages additional material such as short videos, animated graphics, and similar electronic supplementary material.