Skip to search formSkip to main contentSkip to account menu

Discrete & Computational Geometry

Known as: Discrete Comput Geom, Discrete Comput. Geom. 
Discrete & Computational Geometry is a peer-reviewed mathematics journal published quarterly by Springer. Founded in 1986 by Jacob E. Goodman and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
Bregman divergenceConvex hullCriss-cross algorithmCurrent Contents

Broader (1)

Computational geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Smoothed Analysis of Order Types
Consider an ordered point set $P = (p_1,\ldots,p_n)$, its order type (denoted by $\chi_P$) is a map which assigns to every triple… 
2015
2015
Accelerated Local Binary Fitting Scheme for Medical Images Segmentation
Geometric and geodesic active contours are typical approaches for medical image segmentation. Specially, local binary fitting… 
2011
2011
An ideal lattice based IBE scheme in the standard model
Under the standard model, an IND-sID-CPA secure IBE (Identity Based Encryption) scheme is proposed, which is based on an improved… 
2011
2011
On the area requirements of Euclidean minimum spanning trees
2006
2006
Guest Editors' Foreword
This issue of Discrete & Computational Geometry contains the detailed proof by T. Hales and S.P. Ferguson of the Kepler… 
2005
2005
CFD Modeling for Urban Area Contaminant Transport and Dispersion : Model Description and Data Requirements
Computational Fluid Dynamics (CFD) modeling for urban area wind, turbulence and contaminant transport and dispersion is becoming… 
2004
2004
Robust geometric methods for surface modeling and manufacturing
We investigate methods to aid in the process of going from a conceptual shape of a part to its physical realization. We present… 
1996
1996
Polygon reconstruction from visibility information
Reconstruction results at tempt, to rebuild polygons from visibility information. R m m s t r u c t i o n of a general polygon… 
1995
1995
Output-sensitive construction of convex hulls
The construction of the convex hull of a nite point set in a low-dimensional Euclidean space is a fundamental problem in… 
1991
1991
Visibility in Simple Polygons
We present a new method of decomposing a simple polygon which allows the preprocessing of the polygon to e ciently answer queries… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)