default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Halperin
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c102]Dror Livnat, Michael M. Bilevich, Dan Halperin:
Tight Motion Planning by Riemannian Optimization for Sliding and Rolling with Finite Number of Contact Points. ICRA 2024: 14333-14340- [c101]Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger:
Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. SODA 2024: 4942-4962 - [i54]Michael M. Bilevich, Shahar Guini Menashe, Dan Halperin:
Localization in Dynamic Planar Environments Using Few Distance Measurements. CoRR abs/2407.03219 (2024) - [i53]Mikkel Abrahamsen, Dan Halperin:
Ten Problems in Geobotics. CoRR abs/2408.12657 (2024) - 2023
- [j82]Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor:
Multi-robot motion planning for unit discs with revolving areas. Comput. Geom. 114: 102019 (2023) - [j81]Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir:
Space-Aware Reconfiguration. Discret. Comput. Geom. 69(4): 1157-1194 (2023) - [j80]Dan Halperin
, Micha Sharir, Itay Yehuda:
Throwing a Sofa Through the Window. Discret. Comput. Geom. 70(4): 1169-1220 (2023) - [j79]Michal Kleinbort, Kiril Solovey, Zakary Littlefield, Kostas E. Bekris, Dan Halperin:
Corrections to "Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning With Forward Propagation". IEEE Robotics Autom. Lett. 8(2): 1149-1150 (2023) - [j78]Dror Dayan, Kiril Solovey, Marco Pavone, Dan Halperin:
Near-Optimal Multi-Robot Motion Planning with Finite Sampling. IEEE Trans. Robotics 39(5): 3422-3436 (2023) - [c100]Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav:
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. AAMAS 2023: 932-940 - [c99]Michael M. Bilevich, Steven M. LaValle, Dan Halperin:
Sensor Localization by Few Distance Measurements via the Intersection of Implicit Manifolds. ICRA 2023: 1912-1918 - [c98]Guillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán, Rodrigo I. Silveira:
Shortest Coordinated Motion for Square Robots. WADS 2023: 430-443 - [i52]Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav:
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. CoRR abs/2303.00745 (2023) - [i51]Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger:
Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. CoRR abs/2310.20615 (2023) - 2022
- [j77]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. 67(2): 439-461 (2022) - [j76]Nir Goren, Efi Fogel, Dan Halperin:
Area Optimal Polygonization Using Simulated Annealing. ACM J. Exp. Algorithmics 27: 2.3:1-2.3:17 (2022) - [j75]Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead. ACM Trans. Algorithms 18(3): 26:1-26:27 (2022) - [c97]Tzvika Geft, Dan Halperin:
Refined Hardness of Distance-Optimal Multi-Agent Path Finding. AAMAS 2022: 481-488 - [c96]Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot:
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. SoCG 2022: 12:1-12:16 - [c95]Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor:
Multi-Robot Motion Planning for Unit Discs with Revolving Areas. ISAAC 2022: 35:1-35:20 - [i50]Nir Goren, Efi Fogel, Dan Halperin:
CGAL Made More Accessible. CoRR abs/2202.13889 (2022) - [i49]Tzvika Geft, Dan Halperin:
Refined Hardness of Distance-Optimal Multi-Agent Path Finding. CoRR abs/2203.07416 (2022) - [i48]Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot:
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. CoRR abs/2205.07777 (2022) - [i47]Dan Halperin, Steven M. LaValle, Barak Ugav:
Localization with Few Distance Measurements. CoRR abs/2209.04838 (2022) - [i46]Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor:
Multi-Robot Motion Planning for Unit Discs with Revolving Areas. CoRR abs/2210.00123 (2022) - 2021
- [j74]Rahul Shome, Kiril Solovey, Jingjin Yu, Kostas E. Bekris, Dan Halperin:
Fast, High-Quality Two-Arm Rearrangement in Synchronous, Monotone Tabletop Setups. IEEE Trans Autom. Sci. Eng. 18(3): 888-901 (2021) - [c94]Dan Halperin, Micha Sharir, Itay Yehuda:
Throwing a Sofa Through the Window. SoCG 2021: 41:1-41:16 - [c93]Dror Dayan, Kiril Solovey, Marco Pavone, Dan Halperin:
Near-Optimal Multi-Robot Motion Planning with Finite Sampling. ICRA 2021: 9190-9196 - [c92]Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin:
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. SODA 2021: 1740-1756 - [c91]Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir:
Space-Aware Reconfiguration. WAFR 2021: 37-53 - [c90]Tom Tsabar, Efi Fogel, Dan Halperin:
Optimized Synthesis of Snapping Fixtures. WAFR 2021: 143-158 - [i45]Dan Halperin, Micha Sharir, Itay Yehuda:
Throwing a Sofa Through the Window. CoRR abs/2102.04262 (2021) - [i44]Tzvika Geft, Dan Halperin:
On the Complexity of a Family of Decoupled Multi-Robot Motion Planning Problems. CoRR abs/2104.07011 (2021) - 2020
- [j73]Rahul Shome, Kiril Solovey, Andrew Dobson, Dan Halperin, Kostas E. Bekris:
dRRT*: Scalable and informed asymptotically-optimal multi-robot motion planning. Auton. Robots 44(3-4): 443-467 (2020) - [c89]Michal Kleinbort, Edgar Granados, Kiril Solovey, Riccardo Bonalli, Kostas E. Bekris, Dan Halperin:
Refined Analysis of Asymptotically-Optimal Kinodynamic Planning in the State-Cost Space. ICRA 2020: 6344-6350 - [i43]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. CoRR abs/2003.00518 (2020) - [i42]Nir Goren, Dan Halperin, Sivan Toledo:
Geometric Sparsification of Closeness Relations: Eigenvalue Clustering for Computing Matrix Functions. CoRR abs/2003.11914 (2020) - [i41]Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir:
Space-Aware Reconfiguration. CoRR abs/2006.04402 (2020) - [i40]Tzvika Geft, Aviv Tamar, Ken Goldberg, Dan Halperin:
Robust 2D Assembly Sequencing via Geometric Planning with Learned Scores. CoRR abs/2009.09408 (2020) - [i39]Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin:
On Two-Handed Planar Assembly Partitioning. CoRR abs/2009.12369 (2020) - [i38]Dror Dayan, Kiril Solovey, Marco Pavone, Dan Halperin:
Near-Optimal Multi-Robot Motion Planning with Finite Sampling. CoRR abs/2011.08944 (2020)
2010 – 2019
- 2019
- [j72]Michal Kleinbort, Kiril Solovey, Zakary Littlefield, Kostas E. Bekris, Dan Halperin:
Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning With Forward Propagation. IEEE Robotics Autom. Lett. 4(2): 277-283 (2019) - [c88]Tzvika Geft, Aviv Tamar, Ken Goldberg, Dan Halperin:
Robust 2D Assembly Sequencing via Geometric Planning with Learned Scores. CASE 2019: 1603-1610 - [c87]Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead. SoCG 2019: 26:1-26:15 - [i37]Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Dynamic Maintenance of the Lower Envelope of Pseudo-Lines. CoRR abs/1902.09565 (2019) - [i36]Rahul Shome, Kiril Solovey, Andrew Dobson, Dan Halperin, Kostas E. Bekris:
dRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning. CoRR abs/1903.00994 (2019) - [i35]Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead. CoRR abs/1903.10943 (2019) - [i34]Ravid Cohen, Yossi Yovel, Dan Halperin:
Sensory Regimes of Effective Distributed Searching without Leaders. CoRR abs/1904.02895 (2019) - [i33]Michal Kleinbort, Kiril Solovey, Riccardo Bonalli, Kostas E. Bekris, Dan Halperin:
RRT2.0 for Fast and Optimal Kinodynamic Sampling-Based Motion Planning. CoRR abs/1909.05569 (2019) - [i32]Tom Tsabar, Efi Fogel, Dan Halperin:
Optimized Synthesis of Snapping Fixtures. CoRR abs/1909.05953 (2019) - 2018
- [j71]Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr:
Exact Minkowski sums of polygons with holes. Comput. Geom. 73: 46-56 (2018) - [j70]Kiril Solovey, Oren Salzman, Dan Halperin:
New perspective on sampling-based motion planning via random geometric graphs. Int. J. Robotics Res. 37(10) (2018) - [j69]Aviel Atias, Kiril Solovey, Oren Salzman, Dan Halperin:
Effective metrics for multi-robot motion-planning. Int. J. Robotics Res. 37(13-14) (2018) - [c86]Rahul Shome, Kiril Solovey, Jingjin Yu, Kostas E. Bekris, Dan Halperin:
Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups. WAFR 2018: 778-795 - [c85]Israela Solomon, Dan Halperin:
Motion Planning for Multiple Unit-Ball Robots in \(\mathbb {R}^{{\varvec{d}}}\). WAFR 2018: 799-816 - [i31]Israela Solomon, Dan Halperin:
Motion Planning for Multiple Unit-Ball Robots in ℝd. CoRR abs/1807.05428 (2018) - [i30]Michal Kleinbort, Kiril Solovey, Zakary Littlefield, Kostas E. Bekris, Dan Halperin:
Probabilistic completeness of RRT for geometric and kinodynamic planning with forward propagation. CoRR abs/1809.07051 (2018) - [i29]Rahul Shome, Kiril Solovey, Jingjin Yu, Kostas E. Bekris, Dan Halperin:
Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups. CoRR abs/1810.12202 (2018) - 2017
- [c84]Prosenjit Bose, Dan Halperin, Shahar Shamai:
On the separation of a polyhedron from its single-part mold. CASE 2017: 61-66 - [c83]Kiril Solovey, Dan Halperin:
Efficient sampling-based bottleneck pathfinding over cost maps. IROS 2017: 2003-2009 - [c82]Andrew Dobson, Kiril Solovey, Rahul Shome, Dan Halperin, Kostas E. Bekris:
Scalable asymptotically-optimal multi-robot motion planning. MRS 2017: 120-127 - [c81]Aviel Atias, Kiril Solovey, Dan Halperin:
Effective Metrics for Multi-Robot Motion-Planning. Robotics: Science and Systems 2017 - [i28]Aviel Atias, Kiril Solovey, Dan Halperin:
Effective Metrics for Multi-Robot Motion-Planning. CoRR abs/1705.10300 (2017) - [i27]Andrew Dobson, Kiril Solovey, Rahul Shome, Dan Halperin, Kostas E. Bekris:
Scalable Asymptotically-Optimal Multi-Robot Motion Planning. CoRR abs/1706.09932 (2017) - [i26]Prosenjit Bose, Dan Halperin, Shahar Shamai:
On the Separation of a Polyhedron from Its Single-Part Mold. CoRR abs/1708.04203 (2017) - 2016
- [j68]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Optimal randomized incremental construction for guaranteed logarithmic planar point location. Comput. Geom. 58: 110-123 (2016) - [j67]Kiril Solovey, Oren Salzman, Dan Halperin:
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning. Int. J. Robotics Res. 35(5): 501-513 (2016) - [j66]Kiril Solovey, Dan Halperin:
On the hardness of unlabeled multi-robot motion planning. Int. J. Robotics Res. 35(14): 1750-1759 (2016) - [j65]Oren Salzman, Kiril Solovey, Dan Halperin:
Motion Planning for Multilink Robots by Implicit Configuration-Space Tiling. IEEE Robotics Autom. Lett. 1(2): 760-767 (2016) - [j64]Oren Salzman, Dan Halperin:
Asymptotically Near-Optimal RRT for Fast, High-Quality Motion Planning. IEEE Trans. Robotics 32(3): 473-483 (2016) - [c80]Kiril Solovey, Dan Halperin:
Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching. ESA 2016: 76:1-76:16 - [c79]Kiril Solovey, Oren Salzman, Dan Halperin:
New perspective on sampling-based motion planning via random geometric graphs. Robotics: Science and Systems 2016 - [c78]Michal Kleinbort, Oren Salzman, Dan Halperin:
Collision Detection or Nearest-Neighbor Search? On the Computational Bottleneck in Sampling-based Motion Planning. WAFR 2016: 624-639 - [r4]Dan Halperin:
Engineering Geometric Algorithms. Encyclopedia of Algorithms 2016: 634-638 - [i25]Kiril Solovey, Oren Salzman, Dan Halperin:
New perspective on sampling-based motion planning via random geometric graphs. CoRR abs/1602.05460 (2016) - [i24]Kiril Solovey, Dan Halperin:
Sampling-based bottleneck pathfinding with applications to Frechet matching. CoRR abs/1607.02770 (2016) - [i23]Michal Kleinbort, Oren Salzman, Dan Halperin:
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning. CoRR abs/1607.04800 (2016) - [i22]Kiril Solovey, Dan Halperin:
Efficient sampling-based bottleneck pathfinding over cost maps. CoRR abs/1608.00261 (2016) - 2015
- [j63]Oren Salzman, Michael Hemmer, Dan Halperin:
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. IEEE Trans Autom. Sci. Eng. 12(2): 529-538 (2015) - [j62]Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey:
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons. IEEE Trans Autom. Sci. Eng. 12(4): 1309-1317 (2015) - [c77]Ronald van Zon, Diego Escudero, Dan Halperin, Igor Jovanovic, Raffaelle Vito, Rodrigo I. Silveira, Kevin Buchin:
Real-time collision detection for multiple packaging robots using monotonicity of configuration subspaces. CASE 2015: 1638-1643 - [c76]Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr:
Exact Minkowski Sums of Polygons With Holes. ESA 2015: 71-82 - [c75]Dan Halperin, Michael Kerber, Doron Shaharabani:
The Offset Filtration of Convex Objects. ESA 2015: 705-716 - [c74]Michal Kleinbort, Oren Salzman, Dan Halperin:
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. ICRA 2015: 2985-2990 - [c73]Oren Salzman, Dan Halperin:
Optimal motion planning for a tethered robot: Efficient preprocessing for fast shortest paths queries. ICRA 2015: 4161-4166 - [c72]Oren Salzman, Dan Halperin:
Asymptotically-optimal Motion Planning using lower bounds on cost. ICRA 2015: 4167-4172 - [c71]Kiril Solovey, Dan Halperin:
On the hardness of unlabeled multi-robot motion planning. Robotics: Science and Systems 2015 - [c70]Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin:
Motion Planning for Unlabeled Discs with Optimality Guarantees. Robotics: Science and Systems 2015 - [i21]Alon Baram, Efi Fogel, Michael Hemmer, Dan Halperin, Sebastian Morr:
Exact Minkowski Sums of Polygons With Holes. CoRR abs/1502.06195 (2015) - [i20]Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin:
Motion Planning for Unlabeled Discs with Optimality Guarantees. CoRR abs/1504.05218 (2015) - [i19]Oren Salzman, Kiril Solovey, Dan Halperin:
Motion Planning for Multi-Link Robots by Implicit Configuration-Space Tiling. CoRR abs/1504.06631 (2015) - 2014
- [j61]Kiril Solovey, Dan Halperin:
k-color multi-robot motion planning. Int. J. Robotics Res. 33(1): 82-97 (2014) - [j60]Oren Salzman, Doron Shaharabani, Pankaj K. Agarwal, Dan Halperin:
Sparsification of motion-planning roadmaps by edge contraction. Int. J. Robotics Res. 33(14): 1711-1725 (2014) - [c69]Oren Salzman, Dan Halperin:
Asymptotically near-optimal RRT for fast, high-quality, motion planning. ICRA 2014: 4680-4685 - [c68]Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey:
Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons. WAFR 2014: 1-17 - [c67]Kiril Solovey, Oren Salzman, Dan Halperin:
Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-robot Motion Planning. WAFR 2014: 591-607 - [i18]Oren Salzman, Dan Halperin:
Asymptotically Near-Optimal Motion Planning using Lower Bounds on Cost. CoRR abs/1403.7714 (2014) - [i17]Dan Halperin, Michael Kerber, Doron Shaharabani:
The Offset Filtration of Convex Objects. CoRR abs/1407.6132 (2014) - [i16]Kiril Solovey, Dan Halperin:
PSPACE-hardness of unlabeled motion planning and variants. CoRR abs/1408.2260 (2014) - [i15]Michal Kleinbort, Oren Salzman, Dan Halperin:
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. CoRR abs/1409.8112 (2014) - [i14]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Optimal randomized incremental construction for guaranteed logarithmic planar point location. CoRR abs/1410.5602 (2014) - 2013
- [j59]Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. Algorithmica 67(4): 547-565 (2013) - [j58]Efi Fogel, Dan Halperin:
Polyhedral Assembly Partitioning With Infinite Translations or The Importance of Being Exact. IEEE Trans Autom. Sci. Eng. 10(2): 227-241 (2013) - [c66]Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal, Dan Halperin:
Sparsification of motion-planning roadmaps by edge contraction. ICRA 2013: 4098-4105 - [i13]Kiril Solovey, Oren Salzman, Dan Halperin:
Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-Robot Motion Planning. CoRR abs/1305.2889 (2013) - [i12]Oren Salzman, Dan Halperin:
Asymptotically near-optimal RRT for fast, high-quality, motion planning. CoRR abs/1308.0189 (2013) - [i11]Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey:
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons. CoRR abs/1312.1038 (2013) - 2012
- [b2]Efi Fogel, Dan Halperin, Ron Wein:
CGAL Arrangements and Their Applications - A Step-by-Step Guide. Geometry and Computing 7, Springer 2012, ISBN 978-3-642-17282-3, pp. I-XIX, 1-293 - [j57]Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing Approximate Offsets. Discret. Comput. Geom. 48(4): 964-989 (2012) - [j56]Guy E. Blelloch, Dan Halperin:
Introduction to special issue ALENEX'10. ACM J. Exp. Algorithmics 17(1) (2012) - [c65]Efi Fogel, Michael Hemmer, Asaf Porat, Dan Halperin:
Lines through Segments in 3D Space. ESA 2012: 455-466 - [c64]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Improved Implementation of Point Location in General Two-Dimensional Subdivisions. ESA 2012: 611-623 - [c63]Kiril Solovey, Dan Halperin:
k-Color Multi-robot Motion Planning. WAFR 2012: 191-207 - [c62]Oren Salzman, Michael Hemmer, Dan Halperin:
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. WAFR 2012: 313-329 - [i10]Oren 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) - [i9]Kiril Solovey, Dan Halperin:
k-Color Multi-Robot Motion Planning. CoRR abs/1202.6174 (2012) - [i8]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Improved Implementation of Point Location in General Two-Dimensional Subdivisions. CoRR abs/1205.5434 (2012) - [i7]Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal, Dan Halperin:
Sparsification of Motion-Planning Roadmaps by Edge Contraction. CoRR abs/1209.4463 (2012) - 2011
- [j55]Dan Halperin, Kurt Mehlhorn:
Guest Editorial: Selected Papers from European Symposium on Algorithms. Algorithmica 60(1): 1-2 (2011) - [j54]Naama Mayer, Efi Fogel, Dan Halperin:
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. Comput. Aided Des. 43(10): 1258-1269 (2011) - [j53]Barak Raveh, Angela Enosh, Dan Halperin:
A Little More, a Lot Better: Improving Path Quality by a Path-Merging Algorithm. IEEE Trans. Robotics 27(2): 365-371 (2011) - [c61]Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing approximate offsets. SCG 2011: 187-196 - [c60]Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. ESA 2011: 493-505 - [i6]Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. CoRR abs/1107.0803 (2011) - [i5]Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing Approximate Offsets. CoRR abs/1109.2158 (2011) - 2010
- [j52]Eitan Yaffe, Dan Halperin:
Approximating the Pathway Axis and the Persistence Diagrams for a Collection of Balls in 3-Space. Discret. Comput. Geom. 44(3): 660-685 (2010) - [j51]Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein:
Arrangements on Parametric Surfaces I: General Framework and Infrastructure. Math. Comput. Sci. 4(1): 45-66 (2010) - [j50]Eric Berberich, Efi Fogel, Dan Halperin, Michael Kerber, Ophir Setter:
Arrangements on Parametric Surfaces II: Concretizations and Applications. Math. Comput. Sci. 4(1): 67-91 (2010) - [j49]Ophir Setter, Micha Sharir, Dan Halperin:
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. Trans. Comput. Sci. 9: 1-27 (2010) - [c59]Michael 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 - [c58]Dan Halperin:
Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic. ICMS 2010: 92-95 - [c57]Naama 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 - [c56]Oren Nechushtan, Barak Raveh, Dan Halperin:
Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners. WAFR 2010: 285-301 - [e2]Guy E. Blelloch, Dan Halperin:
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX 2010, Austin, Texas, USA, January 16, 2010. SIAM 2010, ISBN 978-0-898719-31-4 [contents] - [i4]Barak 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) - [i3]Itamar 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)
2000 – 2009
- 2009
- [j48]Efi Fogel, Dan Halperin, Christophe Weibel:
On the Exact Maximum Complexity of Minkowski Sums of Polytopes. Discret. Comput. Geom. 42(4): 654-669 (2009) - [j47]Barak Raveh, Angela Enosh, Ora Schueler-Furman, Dan Halperin:
Rapid Sampling of Molecular Motions with Prior Information Constraints. PLoS Comput. Biol. 5(2) (2009) - [c55]Ophir Setter, Micha Sharir, Dan Halperin:
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. ISVD 2009: 43-52 - 2008
- [j46]Ron Wein, Jur P. van den Berg, Dan Halperin:
Planning High-quality Paths and Corridors Amidst Obstacles. Int. J. Robotics Res. 27(11-12): 1213-1231 (2008) - [j45]Idit Haran, Dan Halperin:
An experimental study of point location in planar arrangements in CGAL. ACM J. Exp. Algorithmics 13 (2008) - [j44]Eitan Yaffe, Dan Fishelovitch, Haim J. Wolfson, Dan Halperin, Ruth Nussinov:
MolAxis: a server for identification of channels in macromolecules. Nucleic Acids Res. 36(Web-Server-Issue): 210-215 (2008) - [c54]Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir:
The complexity of the outer face in arrangements of random segments. SCG 2008: 69-78 - [c53]Efi Fogel, Ophir Setter, Dan Halperin:
Arrangements of geodesic arcs on the sphere. SCG 2008: 218-219 - [c52]Eitan Yaffe, Dan Halperin:
Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space. SCG 2008: 260-269 - [c51]Efi Fogel, Dan Halperin:
Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact. WAFR 2008: 417-432 - [e1]Dan Halperin, Kurt Mehlhorn:
Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Lecture Notes in Computer Science 5193, Springer 2008, ISBN 978-3-540-87743-1 [contents] - [r3]Dan Halperin:
Engineering Geometric Algorithms. Encyclopedia of Algorithms 2008 - 2007
- [j43]Angela Enosh, Sarel Jacob Fleishman, Nir Ben-Tal, Dan Halperin:
Prediction and simulation of motion in pairs of transmembrane alpha-helices. Bioinform. 23(2): 212-218 (2007) - [j42]Efi Fogel, Dan Halperin:
Exact and efficient construction of Minkowski sums of convex polyhedra with applications. Comput. Aided Des. 39(11): 929-940 (2007) - [j41]Ron Wein, Jur P. van den Berg, Dan Halperin:
The visibility-Voronoi complex and its applications. Comput. Geom. 36(1): 66-87 (2007) - [j40]Mark de Berg, Dan Halperin, Mark H. Overmars:
An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3): 159-165 (2007) - [j39]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) - [c50]Efi Fogel, Dan Halperin, Christophe Weibel:
On the exact maximum complexity of Minkowski sums of convex polyhedra. SCG 2007: 319-326 - [c49]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 - 2006
- [c48]Efi Fogel, Dan Halperin:
Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications. ALENEX 2006: 3-15 - [c47]Idit Haran, Dan Halperin:
An Experimental Study of Point Location in General Planar Arrangements. ALENEX 2006: 16-25 - [c46]Ron Wein, Jur P. van den Berg, Dan Halperin:
Planning Near-Optimal Corridors Amidst Obstacles. WAFR 2006: 491-506 - 2005
- [j38]Oleg Ilushin, Gershon Elber, Dan Halperin, Ron Wein, Myung-Soo Kim:
Precise global collision detection in multi-axis NC-machining. Comput. Aided Des. 37(9): 909-920 (2005) - [j37]Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin:
Continuous Path Verification in Multi-axis Nc-machining. Int. J. Comput. Geom. Appl. 15(4): 351-378 (2005) - [c45]Eran Eyal, Dan Halperin:
Dynamic maintenance of molecular surfaces under conformational changes. SCG 2005: 45-54 - [c44]Ron Wein, Jur P. van den Berg, Dan Halperin:
The Visibility-Voronoi Complex and Its Applications. SCG 2005: 63-72 - [c43]Efi Fogel, Dan Halperin:
Exact Minkowski sums of convex polyhedra. SCG 2005: 382-383 - [c42]Eran Eyal, Dan Halperin:
Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity. WABI 2005: 401-413 - [i2]Ron Wein, Jur P. van den Berg, Dan Halperin:
The visibility-Voronoi complex and its applications. EuroCG 2005: 151-154 - 2004
- [j36]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) - [j35]Dan Halperin, Eran Leiserowitz:
Controlled perturbation for arrangements of circles. Int. J. Comput. Geom. Appl. 14(4-5): 277-310 (2004) - [j34]Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe:
Algorithm and Data Structures for Efficient Energy Maintenance during Monte Carlo Simulation of Proteins. J. Comput. Biol. 11(5): 902-932 (2004) - [c41]Dan Halperin:
Engineering Geometric Algorithms: Persistent Problems and Some Solutions (Abstract of invited talk). ALENEX/ANALC 2004: 3 - [c40]Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin:
Continuous path verification in multi-axis NC-machining. SCG 2004: 86-95 - [c39]Efi Fogel, Ron Wein, Dan Halperin:
Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements. ESA 2004: 664-676 - [c38]Angela Enosh, Sarel Jacob Fleishman, Nir Ben-Tal, Dan Halperin:
Assigning transmembrane segments to helices in intermediate-resolution structures. ISMB/ECCB (Supplement of Bioinformatics) 2004: 122-129 - [r2]Dan Halperin:
Arrangements. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 529-562 - [r1]Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe:
Robotics. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1065-1093 - 2003
- [j33]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. Geom. Appl. 13(6): 463-485 (2003) - [c37]Dan Halperin, Eran Leiserowitz:
Controlled perturbation for arrangements of circles. SCG 2003: 264-273 - 2002
- [j32]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an object from its cast. Comput. Aided Des. 34(8): 547-559 (2002) - [j31]Pankaj K. Agarwal, Eyal Flato, Dan Halperin:
Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. 21(1-2): 39-61 (2002) - [j30]Dan Halperin, Eli Packer:
Iterated snap rounding. Comput. Geom. 23(2): 209-225 (2002) - [j29]Dan Halperin:
Robust Geometric Computing in Motion. Int. J. Robotics Res. 21(3): 219-232 (2002) - [j28]Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
The 2-Center Problem with Obstacles. J. Algorithms 42(1): 109-134 (2002) - [c36]Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe:
Efficient maintenance and self-collision testing for Kinematic Chains. SCG 2002: 43-52 - [c35]Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz:
Exact minkowski sums and applications. SCG 2002: 273-274 - [c34]Hayim Shaul, Dan Halperin:
Improved construction of vertical decompositions of three-dimensional arrangements. SCG 2002: 283-292 - [c33]Eti Ezra, Dan Halperin, Micha Sharir:
Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. ESA 2002: 473-484 - [c32]Shai Hirsch, Dan Halperin:
Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane. WAFR 2002: 239-256 - 2001
- [j27]Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir:
On the Number of Regular Vertices of the Union of Jordan Regions. Discret. Comput. Geom. 25(2): 203-220 (2001) - [j26]Pankaj K. Agarwal, Dan Halperin, Richard Pollack:
Guest Editors' Foreword. Discret. Comput. Geom. 25(4): 505-506 (2001) - 2000
- [j25]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) - [j24]Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra:
The Design and Implementation of Planar Maps in CGAL. ACM J. Exp. Algorithmics 5: 13 (2000) - [c31]Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
The 2-center problem with obstacles. SCG 2000: 80-90 - [c30]Pankaj K. Agarwal, Eyal Flato, Dan Halperin:
Polygon Decomposition for Efficient Construction of Minkowski Sums. ESA 2000: 20-31 - [c29]Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer:
On the Number of Views of Polyhedral Scenes. JCDCG 2000: 81-90 - [c28]Iddo Hanniel, Dan Halperin:
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves. WAE 2000: 171-182 - [i1]Eyal Flato, Dan Halperin:
Robust and Efficient Construction of Planar Minkowski Sums. EuroCG 2000: 85-88
1990 – 1999
- 1999
- [j23]Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin:
On the Area Bisectors of a Polygon. Discret. Comput. Geom. 22(2): 269-285 (1999) - [c27]Yiorgos L. Chrysanthou, Daniel Cohen-Or, Gadi Fibich, Dan Halperin, Eyal Zadicario, Shuly Lev-Yehudi, Dirk Bartz, Michael Meißner, Tobias Hüttner, Jirí Bittner, Vlastimil Havran, Pavel Slavík, James T. Klosowski, Cláudio T. Silva:
Tutorial 9 - Visibility. Eurographics (Tutorials) 1999 - [c26]Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart:
On-Line Zone Construction in Arrangements of Lines in the Plane. WAE 1999: 139-153 - [c25]Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan:
The Design and Implementation of Planar Maps in CGAL. WAE 1999: 154-168 - [p1]Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe:
Robot Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j22]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) - [j21]Dan Halperin, Chee-Keng Yap:
Combinatorial complexity of translating a box in polyhedral 3-space. Comput. Geom. 9(3): 181-196 (1998) - [j20]Dan Halperin, Christian R. Shelton:
A perturbation scheme for spherical arrangements with application to molecular modeling. Comput. Geom. 10(4): 273-287 (1998) - [j19]Dan Halperin, Mark H. Overmars:
Spheres, molecules, and hidden surface removal. Comput. Geom. 11(2): 83-102 (1998) - [j18]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. Geom. Appl. 8(2): 179-200 (1998) - [c24]Dan Halperin, Jean-Claude Latombe, Randall H. Wilson:
A General Framework for Assembly Planning: The Motion Space Approach. SCG 1998: 9-18 - [c23]Moses Charikar, Dan Halperin, Rajeev Motwani:
The Dynamic Servers Problem. SODA 1998: 410-419 - [c22]Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir:
On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998: 322-334 - 1997
- [j17]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. Geom. Appl. 7(3): 175-195 (1997) - [c21]Dan Halperin, Christian R. Shelton:
A Perturbation Scheme for Spherical Arrangements with Application to Molecular Modeling. SCG 1997: 183-192 - [c20]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an Object from its Cast. SCG 1997: 221-230 - [c19]Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin:
The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields. SCG 1997: 457-459 - 1996
- [j16]Dan Halperin, Randall H. Wilson:
Assembly partitioning along simple paths: the case of multiple translations. Adv. Robotics 11(2): 127-145 (1996) - [j15]Mark de Berg, Leonidas J. Guibas, Dan Halperin:
Vertical Decompositions for Triangles in 3-Space. Discret. Comput. Geom. 15(1): 35-61 (1996) - [j14]Dan Halperin, Micha Sharir:
A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. Discret. Comput. Geom. 16(2): 121-134 (1996) - [c18]Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir:
Efficient Generation of k-Directional Assembly Sequences. SODA 1996: 122-131 - [c17]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 - 1995
- [j13]Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor:
Arrangements of Segments that Share Endpoints Single Face Results. Discret. Comput. Geom. 13: 257-270 (1995) - [j12]Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discret. Comput. Geom. 14(2): 113-122 (1995) - [j11]Dan Halperin, Micha Sharir:
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Discret. Comput. Geom. 14(4): 385-410 (1995) - [j10]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) - [c16]Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink:
The complexity of a single face of a minkowski sum. CCCG 1995: 91-96 - [c15]Dan Halperin, Randall H. Wilson:
Assembly Partitioning along Simple Paths: the Case of Multiple Translations. ICRA 1995: 1585-1592 - [c14]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 - 1994
- [j9]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) - [j8]Dan Halperin:
On the Complexity of a Single Cell in Certain Arrangement of Surfaces Related to Motion Planning. Discret. Comput. Geom. 11: 1-33 (1994) - [j7]Dan Halperin, Micha Sharir:
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. Discret. Comput. Geom. 12: 313-326 (1994) - [j6]Dan Halperin, Micha Sharir:
On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 51(1): 53-56 (1994) - [j5]Dan Halperin:
Robot motion planning and the single cell problem in arrangements. J. Intell. Robotic Syst. 11(1-2): 45-65 (1994) - [c13]Mark de Berg, Leonidas J. Guibas, Dan Halperin:
Vertical Decompositions for Triangles in 3-Space. SCG 1994: 1-10 - [c12]Dan Halperin, Micha Sharir:
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. SCG 1994: 11-20 - [c11]Dan Halperin, Mark H. Overmars:
Spheres, Molecules, and Hidden Surface Removal. SCG 1994: 113-122 - 1993
- [j4]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) - [c10]Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG 1993: 127-132 - [c9]Dan Halperin, Micha Sharir:
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. SCG 1993: 11-18 - [c8]Dan Halperin, Chee-Keng Yap:
Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. SCG 1993: 29-37 - [c7]Dan Halperin, Micha Sharir:
Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment. FOCS 1993: 382-391 - [c6]A. Frank van der Stappen, Dan Halperin, Mark H. Overmars:
Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. ICRA (1) 1993: 297-304 - [c5]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 - 1992
- [b1]Dan Halperin:
Algorithmic motion planning via arrangements of curves and of surfaces. Tel Aviv University, Israel, 1992 - [j3]Dan Halperin, Mark H. Overmars, Micha Sharir:
Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. 21(1): 1-23 (1992) - 1991
- [j2]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) - [j1]Dan Halperin, Micha Sharir:
On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 40(4): 189-192 (1991) - [c4]Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. SCG 1991: 21-30 - [c3]Dan Halperin:
On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract). SCG 1991: 314-323 - [c2]Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor:
Arrangements of Segments that Share Endpoints: Single Face Results. SCG 1991: 324-333
1980 – 1989
- 1989
- [c1]Dan Halperin, Mark H. Overmars:
Efficient Motion Planning for an L-Shaped Object. SCG 1989: 156-166
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
