Smooth shape reconstruction.
Jean-Daniel Boissonnat and Frederic Cazals.
An algorithm for searching a polygonal region with a flashlight.
Steven M. Lavalle, Borislav Simov and Giora Slutzki.
Fast Software for Box Intersections.
Afra Zomorodian and Herbert Edelsbrunner.
Computing with Minkowski sums.
Ioannis Z Emiris.
Algebraic methods and arithmetic filtering for exact predicates on circle arcs.
Olivier Devillers, Alexandra Fronville, Bernard Mourrain and Monique Teillaud.
Reconstructing curves with sharp corners.
Tamal K. Dey and Rafe Wenger.
Densest Translational Lattice Packing of Non-Convex Polygons.
Victor J. Milenkovic.
Pitfalls in Computing with Pseudorandom Determinants.
Bernd Gaertner.
LOOK - A Lazy Object-Oriented Kernel for Geometric Computation.
Stefan Funke.
Computing Approximate Shortest Paths on Convex Polytopes.
Pankaj K. Agarwal, Sariel Har-Peled and Meetesh Karia.
Voronoi-based interpolation with higher continuity.
Hisamoto Hiyoshi and Kokichi Sugihara.
Mesh Generation for Domains with Small Angles.
Jonathan Richard Shewchuk.
Triangulations in CGAL.
J. D. Boissonnat, O. Devillers, M. Teillaud and M. Yvinec.
An Efficient, Exact, and Generic Quadratic Programming Solver for
Geometric Optimization.
Bernd Gaertner and Sven Schoenherr.
Improving the Surface Cycle Structure for Hexahedral Mesh Generation.
Matthias Mueller-Hannemann.
The Analysis of a Simple k-Means Clustering Algorithm.
T. Kanungo, D. M. Mount, N. S. Netanyahu, C. Piatko,
R. Silverman and A. Y. Wu.