In today's fast-paced world, it is increasingly difficult to understand and act promptly upon the content of the many information streams available. Temporal pooling addresse...
Conrad Albrecht-Buehler, Benjamin Watson, David A....
Motivated by applications in architecture and manufacturing, we discuss the problem of covering a freeform surface by single curved panels. This leads to the new concept of semi-d...
Helmut Pottmann, Alexander Schiftner, Pengbo Bo, H...
Fascinating and elegant shapes may be folded from a single planar sheet of material without stretching, tearing or cutting, if one incorporates curved folds into the design. We pr...
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has b...
Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin
We give efficient algorithms for computing a minimum-perimeter k-gon that encloses a given n-gon. Key words: Computational Geometry, Polygon Optimization