|
|
Journals in DBLP
Comput. Geom.
2009, volume: 42, number: 6-7
An optimal extension of the centerpoint theorem. [Citation Graph (, )][DBLP]
Operations preserving the global rigidity of graphs and frameworks in the plane. [Citation Graph (, )][DBLP]
Guarding curvilinear art galleries with vertex or point guards. [Citation Graph (, )][DBLP]
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere. [Citation Graph (, )][DBLP]
Computing the arrangement of circles on a sphere, with applications in structural biology. [Citation Graph (, )][DBLP]
Normal cone approximation and offset shape isotopy. [Citation Graph (, )][DBLP]
Not being (super)thin or solid is hard: A study of grid Hamiltonicity. [Citation Graph (, )][DBLP]
Efficient algorithms for computing Reeb graphs. [Citation Graph (, )][DBLP]
Compatible geometric matchings. [Citation Graph (, )][DBLP]
On minimum weight pseudo-triangulations. [Citation Graph (, )][DBLP]
Constrained minimum enclosing circle with center on a query line segment. [Citation Graph (, )][DBLP]
Ascending and descending regions of a discrete Morse function. [Citation Graph (, )][DBLP]
Linear reconfiguration of cube-style modular robots. [Citation Graph (, )][DBLP]
Point-set embeddings of trees with given partial drawings. [Citation Graph (, )][DBLP]
The equipartition of curves. [Citation Graph (, )][DBLP]
Bounds for point recolouring in geometric graphs. [Citation Graph (, )][DBLP]
Characterization of unlabeled level planar trees. [Citation Graph (, )][DBLP]
Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. [Citation Graph (, )][DBLP]
|
