Publications

For a full list of Dan Halperin's publications sorted by category click here.

Below is a list of publications (sorted by alphabetical order) that are available for downloading from our website.

Title	Description
Robot motion planning and the single cell problem in arrangements	Dan Halperin. Journal of Intelligent and Robotic Systems, 1994
Robust and Efficient Construction of Planar Minkowski Sums	Eyal Flato, M.Sc. thesis
Robust and efficient construction of planar Minkowski sums	Eyal Flato et al. Abstracts 16th European Workshop on Computational Geometry, 2000
Robust geometric computing in motion	Dan Halperin. International Journal of Robotics Research, 21 (3), 2002
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Space	Michal Meyerovitch, M.Sc. Thesis
Separating an object from its cast	Hee-Kap Ahn et al. Computer-Aided Design, 2002
Snap Rounding on the Sphere	Boris Kozorovitzky, M.Sc Thesis
Snap Rounding on the Sphere	Boris Kozorovitzky et al.
Sparse Arrangements and the Number of Views of Polyhedral Scenes	Mark de Berg et al. International Journal of Computational Geometry and Applications , 1997
Spheres, Molecules, and Hidden Surface Removal	Dan Halperin et al. Computational Geometry: Theory and Applications, 1998
Sweeping and Maintaining Two Dimensional Arrangements on Surfaces	Eric Berberich et al, 23rd European Workshop on Computaional Geometry, Graz University of Technology, 2007
The Complexity of a Single Face of a Minkowski Sum	Sariel Har Peled et al. Proc. 7th Canadian Conference on Computational Geometry, University Laval, Quebec, 1995
The complexity of the free space for a robot moving amidst fat obstacles	A. Frank van der Stappen et al. Computational Geometry: Theory and Applications ,1993
The Design and Implementation of Planar Arrangements of Curves in CGAL	Iddo Hanniel, MSc. Thesis
The Design and Implementation of Planar Maps in CGAL	Iddo Hanniel et al, A preliminary version appeared in Proc. 3rd International Workshop on Algorithm Engineering (WAE), London, 1999.
The dynamic servers problem	Moses Charikar et al. Proc. 9th ACM Symposium on Discrete Algorithms (SODA), San Francisco, 1998
The Integration of Exact Arrangements with Effective Motion Planning	Ron Wein, Phd Thesis
The Visibility–Voronoi Complex and Its Applications	Ron Wein et al, a preliminary version appeared in Proc. 21st ACM Symposium on Computational Geometry, Pisa, 2005
Thesis exam presentation	The presentation of the thesis exam
Vertical decompositions for triangles in 3-space	Mark de Berg et al. Discrete and Computational Geometry, 1996

« Previous 20 items 1 2 3 [4]

Sections

Personal tools

Publications

Document Actions