scholar.google.com › citations
Volume 48, Issue 1 · On Levels in Arrangements of Surfaces in Three Dimensions · A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron · Conflict- ...
Bibliographic content of Discrete & Computational Geometry, Volume 48.
Volume 48, Issue 2 · An Incidence Theorem in Higher Dimensions · On the Orlicz Minkowski Problem for Polytopes · Contact Numbers for Congruent Sphere Packings in ...
Vol. 48, No. 3. Volume 48, Issue 3October 2012. Go to Discrete & Computational Geometry Volume 48, Issue 3. Volume 48, Issue 3. October 2012. Read More.
Computational geometry · Sorting and searching · Combinatorial complexity · 3-Connected planar maps · Allowable sequences · Annular medial axis · Approximation ...
On levels in arrangements of surfaces in three dimensions. / Chan, Timothy M. ... In: Discrete and Computational Geometry, Vol. 48, No. 1, 07.2012, p. 1-18.
We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted cases.
People also ask
What is the impact factor of discrete computational geometry?
What is computational geometry for computer graphics?
Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments. · Volume: 3, Issue: 1-2, page 15-48 · ISSN: 0179-5376; 1432-0444/e ...
Unions of fat convex polytopes have short skeletons. / Aronov, Boris; de Berg, Mark. In: Discrete and Computational Geometry, Vol. 48, No. 1, 07.2012, p. 53-64.
Saturated simple and k-simple topological graphs, Computational Geometry: Theory and Applications, Volume 48(4), pp. ... Discrete and Computational Geometry: ...