dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Dan Halperin Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEfi Fogel, Dan Halperin, Ron Wein: CGAL Arrangements and Their Applications - A Step-by-Step Guide. Springer 2012: I-XIX, 1-293
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOren Salzman, Michael Hemmer, Dan Halperin: On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages CoRR abs/1202.5249: (2012)
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiril Solovey, Dan Halperin: k-Color Multi-Robot Motion Planning CoRR abs/1202.6174: (2012)
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Hemmer, Michal Kleinbort, Dan Halperin: Improved Implementation of Point Location in General Two-Dimensional Subdivisions CoRR abs/1205.5434: (2012)
2011
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin: Motion Planning via Manifold Samples. ESA 2011: 493-505
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova: Deconstructing approximate offsets. Symposium on Computational Geometry 2011: 187-196
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Kurt Mehlhorn: Guest Editorial: Selected Papers from European Symposium on Algorithms. Algorithmica 60(1): 1-2 (2011)
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin: Motion Planning via Manifold Samples CoRR abs/1107.0803: (2011)
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova: Deconstructing Approximate Offsets CoRR abs/1109.2158: (2011)
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaama Mayer, Efi Fogel, Dan Halperin: Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. Computer-Aided Design 43(10): 1258-1269 (2011)
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBarak Raveh, Angela Enosh, Dan Halperin: A Little More, a Lot Better: Improving Path Quality by a Path-Merging Algorithm. IEEE Transactions on Robotics 27(2): 365-371 (2011)
2010
113no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuy E. Blelloch, Dan Halperin: Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX 2010, Austin, Texas, USA, January 16, 2010 SIAM 2010
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Hemmer, Ophir Setter, Dan Halperin: Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Point-Location. ESA (1) 2010: 398-409
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin: Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic. ICMS 2010: 92-95
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaama Mayer, Efi Fogel, Dan Halperin: Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. Symposium on Solid and Physical Modeling 2010: 1-10
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOren Nechushtan, Barak Raveh, Dan Halperin: Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners. WAFR 2010: 285-301
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBarak Raveh, Angela Enosh, Dan Halperin: A Little More, a Lot Better: Improving Path Quality by a Simple Path Merging Algorithm CoRR abs/1001.2391: (2010)
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLItamar Berger, Bosmat Eldar, Gal Zohar, Barak Raveh, Dan Halperin: Improving the Quality of Non-Holonomic Motion by Hybridizing C-PRM Paths CoRR abs/1009.4787: (2010)
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEitan Yaffe, Dan Halperin: Approximating the Pathway Axis and the Persistence Diagrams for a Collection of Balls in 3-Space. Discrete & Computational Geometry 44(3): 660-685 (2010)
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein: Arrangements on Parametric Surfaces I: General Framework and Infrastructure. Mathematics in Computer Science 4(1): 45-66 (2010)
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Berberich, Efi Fogel, Dan Halperin, Michael Kerber, Ophir Setter: Arrangements on Parametric Surfaces II: Concretizations and Applications. Mathematics in Computer Science 4(1): 67-91 (2010)
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOphir Setter, Micha Sharir, Dan Halperin: Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. Transactions on Computational Science 9: 1-27 (2010)
2009
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOphir Setter, Micha Sharir, Dan Halperin: Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. ISVD 2009: 43-52
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEfi Fogel, Dan Halperin, Christophe Weibel: On the Exact Maximum Complexity of Minkowski Sums of Polytopes. Discrete & Computational Geometry 42(4): 654-669 (2009)
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBarak Raveh, Angela Enosh, Ora Schueler-Furman, Dan Halperin: Rapid Sampling of Molecular Motions with Prior Information Constraints. PLoS Computational Biology 5(2): (2009)
2008
99no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Kurt Mehlhorn: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings Springer 2008
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEfi Fogel, Ophir Setter, Dan Halperin: Arrangements of geodesic arcs on the sphere. Symposium on Computational Geometry 2008: 218-219
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEitan 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
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga 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
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEfi Fogel, Dan Halperin: Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact. WAFR 2008: 417-432
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin: Engineering Geometric Algorithms. Encyclopedia of Algorithms 2008
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIdit Haran, Dan Halperin: An experimental study of point location in planar arrangements in CGAL. ACM Journal of Experimental Algorithmics 13: (2008)
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon 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)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEitan 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
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein: Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA 2007: 645-656
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEfi Fogel, Dan Halperin, Christophe Weibel: On the exact maximum complexity of Minkowski sums of convex polyhedra. Symposium on Computational Geometry 2007: 319-326
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngela 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)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon Wein, Jur P. van den Berg, Dan Halperin: The visibility-Voronoi complex and its applications. Comput. Geom. 36(1): 66-87 (2007)
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Dan Halperin, Mark H. Overmars: An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3): 159-165 (2007)
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon Wein, Efi Fogel, Baruch Zukerman, Dan Halperin: Advanced programming techniques applied to Cgal's arrangement package. Comput. Geom. 38(1-2): 37-63 (2007)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEfi Fogel, Dan Halperin: Exact and efficient construction of Minkowski sums of convex polyhedra with applications. Computer-Aided Design 39(11): 929-940 (2007)
2006
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon Wein, Jur P. van den Berg, Dan Halperin: Planning Near-Optimal Corridors Amidst Obstacles. WAFR 2006: 491-506
2005
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon Wein, Jur P. van den Berg, Dan Halperin: The visibility-Voronoi complex and its applications. EuroCG 2005: 151-154
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEfi Fogel, Dan Halperin: Exact Minkowski sums of convex polyhedra. Symposium on Computational Geometry 2005: 382-383
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEran Eyal, Dan Halperin: Dynamic maintenance of molecular surfaces under conformational changes. Symposium on Computational Geometry 2005: 45-54
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon Wein, Jur P. van den Berg, Dan Halperin: The Visibility-Voronoi Complex and Its Applications. Symposium on Computational Geometry 2005: 63-72
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEran Eyal, Dan Halperin: Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity. WABI 2005: 401-413
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOleg 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)
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon 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
75no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin: Engineering Geometric Algorithms: Persistent Problems and Some Solutions (Abstract of invited talk). ALENEX/ANALC 2004: 3
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEfi Fogel, Ron Wein, Dan Halperin: Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements. ESA 2004: 664-676
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngela 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
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRon Wein, Oleg Ilushin, Gershon Elber, Dan Halperin: Continuous path verification in multi-axis NC-machining. Symposium on Computational Geometry 2004: 86-95
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEti 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)
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Eran Leiserowitz: Controlled perturbation for arrangements of circles. Int. J. Comput. Geometry Appl. 14(4-5): 277-310 (2004)
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLItay 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
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Eran Leiserowitz: Controlled perturbation for arrangements of circles. Symposium on Computational Geometry 2003: 264-273
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChaim 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
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEti Ezra, Dan Halperin, Micha Sharir: Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. ESA 2002: 473-484
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz: Exact minkowski sums and applications. Symposium on Computational Geometry 2002: 273-274
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHayim Shaul, Dan Halperin: Improved construction of vertical decompositions of three-dimensional arrangements. Symposium on Computational Geometry 2002: 283-292
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLItay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe: Efficient maintenance and self-collision testing for Kinematic Chains. Symposium on Computational Geometry 2002: 43-52
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj K. Agarwal, Eyal Flato, Dan Halperin: Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. 21(1-2): 39-61 (2002)
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Eli Packer: Iterated snap rounding. Comput. Geom. 23(2): 209-225 (2002)
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHee-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)
59no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin: Robust Geometric Computing in Motion. I. J. Robotic Res. 21(3): 219-232 (2002)
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Micha Sharir, Kenneth Y. Goldberg: The 2-Center Problem with Obstacles. J. Algorithms 42(1): 109-134 (2002)
2001
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris 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)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj K. Agarwal, Dan Halperin, Richard Pollack: Guest Editors' Foreword. Discrete & Computational Geometry 25(4): 505-506 (2001)
2000
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIddo Hanniel, Dan Halperin: Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves. Algorithm Engineering 2000: 171-182
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj K. Agarwal, Eyal Flato, Dan Halperin: Polygon Decomposition for Efficient Construction of Minkowski Sums. ESA 2000: 20-31
53no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEyal Flato, Dan Halperin: Robust and Efficient Construction of Planar Minkowski Sums. EuroCG 2000: 85-88
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer: On the Number of Views of Polyhedral Scenes. JCDCG 2000: 81-90
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Micha Sharir, Kenneth Y. Goldberg: The 2-center problem with obstacles. Symposium on Computational Geometry 2000: 80-90
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEyal 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)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan 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
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYuval 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
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan: The Design and Implementation of Planar Maps in CGAL. Algorithm Engineering 1999: 154-168
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin: On the Area Bisectors of a Polygon. Discrete & Computational Geometry 22(2): 269-285 (1999)
1998
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses Charikar, Dan Halperin, Rajeev Motwani: The Dynamic Servers Problem. SODA 1998: 410-419
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998: 322-334
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Jean-Claude Latombe, Randall H. Wilson: A General Framework for Assembly Planning: The Motion Space Approach. Symposium on Computational Geometry 1998: 9-18
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Christian R. Shelton: A perturbation scheme for spherical arrangements with application to molecular modeling. Comput. Geom. 10(4): 273-287 (1998)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Mark H. Overmars: Spheres, molecules, and hidden surface removal. Comput. Geom. 11(2): 83-102 (1998)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Chee-Keng Yap: Combinatorial complexity of translating a box in polyhedral 3-space. Comput. Geom. 9(3): 181-196 (1998)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
38no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeonidas 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
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Christian R. Shelton: A Perturbation Scheme for Spherical Arrangements with Application to Molecular Modeling. Symposium on Computational Geometry 1997: 183-192
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHee-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
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl-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
34no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark 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
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir: Efficient Generation of k-Directional Assembly Sequences. SODA 1996: 122-131
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaul 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
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Randall H. Wilson: Assembly partitioning along simple paths: the case of multiple translations. Advanced Robotics 11(2): 127-145 (1996)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Leonidas J. Guibas, Dan Halperin: Vertical Decompositions for Triangles in 3-Space. Discrete & Computational Geometry 15(1): 35-61 (1996)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan 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
28no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Randall H. Wilson: Assembly Partitioning along Simple Paths: the Case of Multiple Translations. ICRA 1995: 1585-1592
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeonidas 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
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEsther 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)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeonidas 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)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan 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)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark 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
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Leonidas J. Guibas, Dan Halperin: Vertical Decompositions for Triangles in 3-Space. Symposium on Computational Geometry 1994: 1-10
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Micha Sharir: Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Symposium on Computational Geometry 1994: 11-20
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Mark H. Overmars: Spheres, Molecules, and Hidden Surface Removal. Symposium on Computational Geometry 1994: 113-122
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark 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)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin: On the Complexity of a Single Cell in Certain Arrangement of Surfaces Related to Motion Planning. Discrete & Computational Geometry 11: 1-33 (1994)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Micha Sharir: New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. Discrete & Computational Geometry 12: 313-326 (1994)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Micha Sharir: On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 51(1): 53-56 (1994)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin: Robot motion planning and the single cell problem in arrangements. Journal of Intelligent and Robotic Systems 11(1-2): 45-65 (1994)
1993
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir: On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG 1993: 127-132
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Micha Sharir: Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment FOCS 1993: 382-391
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. Frank van der Stappen, Dan Halperin, Mark H. Overmars: Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. ICRA (1) 1993: 297-304
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark 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
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Micha Sharir: New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. Symposium on Computational Geometry 1993: 11-18
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Chee-Keng Yap: Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. Symposium on Computational Geometry 1993: 29-37
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. 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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Mark H. Overmars, Micha Sharir: Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. 21(1): 1-23 (1992)
1991
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan 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
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEsther 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
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan 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)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Micha Sharir: On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 40(4): 189-192 (1991)
1989
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Halperin, Mark H. Overmars: Efficient Motion Planning for an L-Shaped Object. Symposium on Computational Geometry 1989: 156-166

Coauthor Index

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

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page