Dan Halperin

	2008
96		Dan Halperin, Kurt Mehlhorn: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings Springer 2008
95		Efi Fogel, Ophir Setter, Dan Halperin: Arrangements of geodesic arcs on the sphere. Symposium on Computational Geometry 2008: 218-219
94		Eitan Yaffe, Dan Halperin: Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space. Symposium on Computational Geometry 2008: 260-269
93		Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir: The complexity of the outer face in arrangements of random segments. Symposium on Computational Geometry 2008: 69-78
92		Dan Halperin: Engineering Geometric Algorithms. Encyclopedia of Algorithms 2008
91		Idit Haran, Dan Halperin: An experimental study of point location in planar arrangements in CGAL. ACM Journal of Experimental Algorithmics 13: (2008)
90		Ron Wein, Jur P. van den Berg, Dan Halperin: Planning High-quality Paths and Corridors Amidst Obstacles. I. J. Robotic Res. 27(11-12): 1213-1231 (2008)
89		Eitan Yaffe, Dan Fishelovitch, Haim J. Wolfson, Dan Halperin, Ruth Nussinov: MolAxis: a server for identification of channels in macromolecules. Nucleic Acids Research 36(Web-Server-Issue): 210-215 (2008)
	2007
88		Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein: Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA 2007: 645-656
87		Efi Fogel, Dan Halperin, Christophe Weibel: On the exact maximum complexity of Minkowski sums of convex polyhedra. Symposium on Computational Geometry 2007: 319-326
86		Angela Enosh, Sarel J. Fleishman, Nir Ben-Tal, Dan Halperin: Prediction and simulation of motion in pairs of transmembrane alpha-helices. Bioinformatics 23(2): 212-218 (2007)
85		Ron Wein, Jur P. van den Berg, Dan Halperin: The visibility-Voronoi complex and its applications. Comput. Geom. 36(1): 66-87 (2007)
84		Mark de Berg, Dan Halperin, Mark H. Overmars: An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3): 159-165 (2007)
83		Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin: Advanced programming techniques applied to Cgal's arrangement package. Comput. Geom. 38(1-2): 37-63 (2007)
82		Efi Fogel, Dan Halperin: Exact and efficient construction of Minkowski sums of convex polyhedra with applications. Computer-Aided Design 39(11): 929-940 (2007)
	2006
81		Ron Wein, Jur P. van den Berg, Dan Halperin: Planning Near-Optimal Corridors Amidst Obstacles. WAFR 2006: 491-506
	2005
80		Efi Fogel, Dan Halperin: Exact Minkowski sums of convex polyhedra. Symposium on Computational Geometry 2005: 382-383
79		Eran Eyal, Dan Halperin: Dynamic maintenance of molecular surfaces under conformational changes. Symposium on Computational Geometry 2005: 45-54
78		Ron Wein, Jur P. van den Berg, Dan Halperin: The Visibility-Voronoi Complex and Its Applications. Symposium on Computational Geometry 2005: 63-72
77		Eran Eyal, Dan Halperin: Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity. WABI 2005: 401-413
76		Oleg Ilushin, Gershon Elber, Dan Halperin, Ron Wein, Myung-Soo Kim: Precise global collision detection in multi-axis NC-machining. Computer-Aided Design 37(9): 909-920 (2005)
75		Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin: Continuous Path Verification in Multi-axis Nc-machining. Int. J. Comput. Geometry Appl. 15(4): 351-378 (2005)
	2004
74		Dan Halperin: Engineering Geometric Algorithms: Persistent Problems and Some Solutions (Abstract of invited talk). ALENEX/ANALC 2004: 3
73		Efi Fogel, Ron Wein, Dan Halperin: Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements. ESA 2004: 664-676
72		Angela Enosh, Sarel J. Fleishman, Nir Ben-Tal, Dan Halperin: Assigning transmembrane segments to helices in intermediate-resolution structures. ISMB/ECCB (Supplement of Bioinformatics) 2004: 122-129
71		Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin: Continuous path verification in multi-axis NC-machining. Symposium on Computational Geometry 2004: 86-95
70		Eti Ezra, Dan Halperin, Micha Sharir: Speeding up the incremental construction of the union of geometric objects in practice. Comput. Geom. 27(1): 63-85 (2004)
69		Dan Halperin, Eran Leiserowitz: Controlled perturbation for arrangements of circles. Int. J. Comput. Geometry Appl. 14(4-5): 277-310 (2004)
68		Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe: Algorithm and Data Structures for Efficient Energy Maintenance during Monte Carlo Simulation of Proteins. Journal of Computational Biology 11(5): 902-932 (2004)
	2003
67		Dan Halperin, Eran Leiserowitz: Controlled perturbation for arrangements of circles. Symposium on Computational Geometry 2003: 264-273
66		Chaim Linhart, Dan Halperin, Iddo Hanniel, Sariel Har-Peled: An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane. Int. J. Comput. Geometry Appl. 13(6): 463-485 (2003)
	2002
65		Eti Ezra, Dan Halperin, Micha Sharir: Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. ESA 2002: 473-484
64		Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz: Exact minkowski sums and applications. Symposium on Computational Geometry 2002: 273-274
63		Hayim Shaul, Dan Halperin: Improved construction of vertical decompositions of three-dimensional arrangements. Symposium on Computational Geometry 2002: 283-292
62		Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe: Efficient maintenance and self-collision testing for Kinematic Chains. Symposium on Computational Geometry 2002: 43-52
61		Pankaj K. Agarwal, Eyal Flato, Dan Halperin: Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. 21(1-2): 39-61 (2002)
60		Dan Halperin, Eli Packer: Iterated snap rounding. Comput. Geom. 23(2): 209-225 (2002)
59		Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf: Separating an object from its cast. Computer-Aided Design 34(8): 547-559 (2002)
58		Dan Halperin: Robust Geometric Computing in Motion. I. J. Robotic Res. 21(3): 219-232 (2002)
57		Dan Halperin, Micha Sharir, Kenneth Y. Goldberg: The 2-Center Problem with Obstacles. J. Algorithms 42(1): 109-134 (2002)
	2001
56		Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. Discrete & Computational Geometry 25(2): 203-220 (2001)
55		Pankaj K. Agarwal, Dan Halperin, Richard Pollack: Guest Editors' Foreword. Discrete & Computational Geometry 25(4): 505-506 (2001)
	2000
54		Iddo Hanniel, Dan Halperin: Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves. Algorithm Engineering 2000: 171-182
53		Pankaj K. Agarwal, Eyal Flato, Dan Halperin: Polygon Decomposition for Efficient Construction of Minkowski Sums. ESA 2000: 20-31
52		Eyal Flato, Dan Halperin: Robust and Efficient Construction of Planar Minkowski Sums. EWCG 2000: 85-88
51		Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer: On the Number of Views of Polyhedral Scenes. JCDCG 2000: 81-90
50		Dan Halperin, Micha Sharir, Kenneth Y. Goldberg: The 2-center problem with obstacles. Symposium on Computational Geometry 2000: 80-90
49		Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra: The Design and Implementation of Planar Maps in CGAL. ACM Journal of Experimental Algorithmics 5: 13 (2000)
48		Dan Halperin, Jean-Claude Latombe, Randall H. Wilson: A General Framework for Assembly Planning: The Motion Space Approach. Algorithmica 26(3-4): 577-601 (2000)
	1999
47		Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart: On-Line Zone Construction in Arrangements of Lines in the Plane. Algorithm Engineering 1999: 139-153
46		Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan: The Design and Implementation of Planar Maps in CGAL. Algorithm Engineering 1999: 154-168
45		Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin: On the Area Bisectors of a Polygon. Discrete & Computational Geometry 22(2): 269-285 (1999)
	1998
44		Moses Charikar, Dan Halperin, Rajeev Motwani: The Dynamic Servers Problem. SODA 1998: 410-419
43		Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998: 322-334
42		Dan Halperin, Jean-Claude Latombe, Randall H. Wilson: A General Framework for Assembly Planning: The Motion Space Approach. Symposium on Computational Geometry 1998: 9-18
41		Dan Halperin, Christian R. Shelton: A perturbation scheme for spherical arrangements with application to molecular modeling. Comput. Geom. 10(4): 273-287 (1998)
40		Dan Halperin, Mark H. Overmars: Spheres, molecules, and hidden surface removal. Comput. Geom. 11(2): 83-102 (1998)
39		Dan Halperin, Chee-Keng Yap: Combinatorial complexity of translating a box in polyhedral 3-space. Comput. Geom. 9(3): 181-196 (1998)
38		Daniel Cohen-Or, Gadi Fibich, Dan Halperin, Eyal Zadicario: Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes. Comput. Graph. Forum 17(3): 243-254 (1998)
37		Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukawa, Jean-Claude Latombe, Randall H. Wilson: Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes. Int. J. Comput. Geometry Appl. 8(2): 179-200 (1998)
	1997
36		Dan Halperin, Christian R. Shelton: A Perturbation Scheme for Spherical Arrangements with Application to Molecular Modeling. Symposium on Computational Geometry 1997: 183-192
35		Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf: Separating an Object from its Cast. Symposium on Computational Geometry 1997: 221-230
34		Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin: The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields. Symposium on Computational Geometry 1997: 457-459
33		Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld: Sparse Arrangements and the Number of Views of Polyhedral Scenes. Int. J. Comput. Geometry Appl. 7(3): 175-195 (1997)
	1996
32		Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir: Efficient Generation of k-Directional Assembly Sequences. SODA 1996: 122-131
31		Paul W. Finn, Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian: Geometric Manipulation of Flexible Ligands. WACG 1996: 67-78
30		Mark de Berg, Leonidas J. Guibas, Dan Halperin: Vertical Decompositions for Triangles in 3-Space. Discrete & Computational Geometry 15(1): 35-61 (1996)
29		Dan Halperin, Micha Sharir: A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. Discrete & Computational Geometry 16(2): 121-134 (1996)
	1995
28		Dan Halperin, Randall H. Wilson: Assembly Partitioning along Simple Paths: the Case of Multiple Translations. ICRA 1995: 1585-1592
27		Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukawa, Jean-Claude Latombe, Randall H. Wilson: A Simple and Effeicient Procedure for Polyhedral Assembly Partitioning under Infinitesimal Motions. ICRA 1995: 2553-2560
26		Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor: Arrangements of Segments that Share Endpoints Single Face Results. Discrete & Computational Geometry 13: 257-270 (1995)
25		Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir: Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discrete & Computational Geometry 14(2): 113-122 (1995)
24		Dan Halperin, Micha Sharir: Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Discrete & Computational Geometry 14(4): 385-410 (1995)
23		Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud: Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. 140(2): 301-317 (1995)
	1994
22		Mark de Berg, Leonidas J. Guibas, Dan Halperin: Vertical Decompositions for Triangles in 3-Space. Symposium on Computational Geometry 1994: 1-10
21		Dan Halperin, Micha Sharir: Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Symposium on Computational Geometry 1994: 11-20
20		Dan Halperin, Mark H. Overmars: Spheres, Molecules, and Hidden Surface Removal. Symposium on Computational Geometry 1994: 113-122
19		Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld: Efficient Ray Shooting and Hidden Surface Removal. Algorithmica 12(1): 30-53 (1994)
18		Dan Halperin: On the Complexity of a Single Cell in Certain Arrangement of Surfaces Related to Motion Planning. Discrete & Computational Geometry 11: 1-33 (1994)
17		Dan Halperin, Micha Sharir: New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. Discrete & Computational Geometry 12: 313-326 (1994)
16		Dan Halperin, Micha Sharir: On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 51(1): 53-56 (1994)
15		Dan Halperin: Robot motion planning and the single cell problem in arrangements. Journal of Intelligent and Robotic Systems 11(1-2): 45-65 (1994)
	1993
14		Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir: On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG 1993: 127-132
13		Dan Halperin, Micha Sharir: Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment FOCS 1993: 382-391
12		A. Frank van der Stappen, Dan Halperin, Mark H. Overmars: Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. ICRA (1) 1993: 297-304
11		Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir: Reaching a Goal with Directional Uncertainty. ISAAC 1993: 1-10
10		Dan Halperin, Micha Sharir: New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. Symposium on Computational Geometry 1993: 11-18
9		Dan Halperin, Chee-Keng Yap: Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. Symposium on Computational Geometry 1993: 29-37
8		A. Frank van der Stappen, Dan Halperin, Mark H. Overmars: The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles. Comput. Geom. 3: 353-373 (1993)
	1992
7		Dan Halperin, Mark H. Overmars, Micha Sharir: Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. 21(1): 1-23 (1992)
	1991
6		Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld: Efficient Ray Shooting and Hidden Surface Removal. Symposium on Computational Geometry 1991: 21-30
5		Dan Halperin: On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract). Symposium on Computational Geometry 1991: 314-323
4		Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor: Arrangements of Segments that Share Endpoints: Single Face Results. Symposium on Computational Geometry 1991: 324-333
3		Dan Halperin, Micha Sharir: Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom. Comput. Geom. 1: 269-303 (1991)
2		Dan Halperin, Micha Sharir: On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 40(4): 189-192 (1991)
	1989
1		Dan Halperin, Mark H. Overmars: Efficient Motion Planning for an L-Shaped Object. Symposium on Computational Geometry 1989: 156-166

Coauthor Index

1	Pankaj K. Agarwal	[32] [53] [55] [61]
2	Yuval Aharoni	[47]
3	Hee-Kap Ahn	[35] [59]
4	Noga Alon	[93]
5	Esther M. Arkin	[4] [26]
6	Boris Aronov	[43] [51] [56]
7	Nir Ben-Tal	[72] [86]
8	Eric Berberich	[88]
9	Jur P. van den Berg	[78] [81] [85] [90]
10	Mark de Berg	[6] [11] [19] [22] [23] [30] [32] [33] [35] [59] [84]
11	Karl-Friedrich Böhringer	[34] [45]
12	Prosenjit Bose	[35] [59]
13	Hervé Brönnimann	[51]
14	Moses Charikar	[44]
15	Siu-Wing Cheng	[35] [59]
16	Otfried Cheong (Otfried Schwarzkopf)	[11] [23] [35] [59]
17	Daniel Cohen-Or	[38]
18	Bruce Randall Donald	[34] [45]
19	Alon Efrat	[43] [56]
20	Gershon Elber	[71] [75] [76]
21	Angela Enosh	[72] [86]
22	Eran Eyal	[77] [79]
23	Esther Ezra (Eti Ezra)	[49] [65] [70]
24	Gadi Fibich	[38]
25	Paul W. Finn	[31]
26	Dan Fishelovitch	[89]
27	Eyal Flato	[46] [49] [52] [53] [61] [64]
28	Sarel J. Fleishman	[72] [86]
29	Efi Fogel	[64] [73] [80] [82] [83] [87] [88] [95]
30	Kenneth Y. Goldberg	[50] [57]
31	Leonidas J. Guibas	[11] [14] [22] [23] [25] [27] [30] [37]
32	Iddo Hanniel	[46] [47] [49] [54] [66]
33	Sariel Har-Peled	[47] [66]
34	Idit Haran	[91]
35	Hirohisa Hirukawa	[27] [37]
36	Oleg Ilushin	[71] [75] [76]
37	Lydia E. Kavraki	[31]
38	Klara Kedem	[4] [26]
39	Myung-Soo Kim	[76]
40	Marc J. van Kreveld	[6] [19] [33]
41	Jean-Claude Latombe	[27] [31] [37] [42] [48] [62] [68]
42	Eran Leiserowitz	[64] [67] [69]
43	Chaim Linhart	[47] [66]
44	Itay Lotan	[62] [68]
45	Jirí Matousek	[14] [25] [35] [59]
46	Kurt Mehlhorn	[88] [96]
47	Joseph S. B. Mitchell	[4] [26]
48	Rajeev Motwani	[31] [44]
49	Nir Naor	[4] [26]
50	Oren Nechushtan	[46] [49] [93]
51	Ruth Nussinov	[89]
52	Mark H. Overmars	[1] [6] [7] [8] [11] [12] [19] [20] [23] [33] [40] [84]
53	Eli Packer	[60]
54	Richard Pollack	[55]
55	Robert Schiffenbauer	[51]
56	Fabian Schwarzer	[62] [68]
57	Ophir Setter	[95]
58	Micha Sharir	[2] [3] [7] [10] [11] [13] [14] [16] [17] [21] [23] [24] [25] [29] [32] [43] [50] [56] [57] [65] [70] [93]
59	Hayim Shaul	[63]
60	Christian R. Shelton	[31] [36] [41]
61	Jack Snoeyink	[6] [19]
62	A. Frank van der Stappen	[8] [12]
63	Monique Teillaud	[11] [23]
64	Suresh Venkatasubramanian	[31]
65	Christophe Weibel	[87]
66	Ron Wein	[71] [73] [75] [76] [78] [81] [83] [85] [88] [90]
67	Randall H. Wilson	[27] [28] [37] [42] [48]
68	Haim J. Wolfson	[89]
69	Eitan Yaffe	[89] [94]
70	Chee-Keng Yap (Chee Yap)	[9] [39]
71	Eyal Zadicario	[38]
72	Baruch Zukerman	[83]

Colors in the list of coauthors