Dan Halperin - RankMe

254 papers A* 21A 17B 3C 16Journal 139Unranked 51

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	A Full-Cycle Assembly Operation: From Digital Planning to Trajectory Execution Using a Robotic Arm. ICRA Dror Livnat, Yuval Lavi, Dan Halperin
2025	J	`jnl`	A Note on the Time Complexity of Using Subdivision Methods for the Approximation of Fibers. CoRR Michael M. Bilevich, Dan Halperin
2025	J	`jnl`	Algorithms for Nonlinear Mixed-Integer Location Estimation. CoRR Ophir Uziel, Efi Fogel, Dan Halperin, Sivan Toledo
2025	A*	`conf`	Indoor Localization of UAVs Using Only Few Measurements by Output-Sensitive Preimage Intersection. ICRA Michael M. Bilevich, Tomer Buber, Dan Halperin
2025	J	`jnl`	On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. ACM Trans. Algorithms Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin
2025	J	`jnl`	Point Cloud Based Scene Segmentation: A Survey. CoRR Dan Halperin, Niklas Eisl
2025	J	`jnl`	Shortest coordinated motions for square robots. Auton. Robots Guillermo Esteban, Dan Halperin, Rodrigo I. Silveira
2024	J	`jnl`	Localization in Dynamic Planar Environments Using Few Distance Measurements. CoRR Michael M. Bilevich, Shahar Guini Menashe, Dan Halperin
2024	A*	`conf`	Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. SODA Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger
2024	J	`jnl`	Optimal Algorithms for Separating a Polyhedron from its Single-Part Mold. Comput. Geom. Topol. Prosenjit Bose, Efi Fogel, Tzvika Geft, Dan Halperin, Shahar Shamai
2024	J	`jnl`	Ten Problems in Geobotics. CoRR Mikkel Abrahamsen, Dan Halperin
2024	A*	`conf`	Tight Motion Planning by Riemannian Optimization for Sliding and Rolling with Finite Number of Contact Points. ICRA Dror Livnat, Michael M. Bilevich, Dan Halperin
2023	A	`conf`	Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. AAMAS Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav
2023	J	`jnl`	Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. CoRR Mikkel Abrahamsen, Tzvika Geft, Dan Halperin, Barak Ugav
2023	J	`jnl`	Corrections to "Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning With Forward Propagation". IEEE Robotics Autom. Lett. Michal Kleinbort, Kiril Solovey, Zakary Littlefield, Kostas E. Bekris, Dan Halperin
2023	J	`jnl`	Multi-robot motion planning for unit discs with revolving areas. Comput. Geom. Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor
2023	J	`jnl`	Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. CoRR Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger
2023	J	`jnl`	Near-Optimal Multi-Robot Motion Planning with Finite Sampling. IEEE Trans. Robotics Dror Dayan, Kiril Solovey, Marco Pavone, Dan Halperin
2023	A*	`conf`	Sensor Localization by Few Distance Measurements via the Intersection of Implicit Manifolds. ICRA Michael M. Bilevich, Steven M. LaValle, Dan Halperin
2023	B	`conf`	Shortest Coordinated Motion for Square Robots. WADS Guillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán, Rodrigo I. Silveira
2023	J	`jnl`	Space-Aware Reconfiguration. Discret. Comput. Geom. Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir
2023	J	`jnl`	Throwing a Sofa Through the Window. Discret. Comput. Geom. Dan Halperin, Micha Sharir, Itay Yehuda
2022	J	`jnl`	Area Optimal Polygonization Using Simulated Annealing. ACM J. Exp. Algorithmics Nir Goren, Efi Fogel, Dan Halperin
2022	J	`jnl`	CGAL Made More Accessible. CoRR Nir Goren, Efi Fogel, Dan Halperin
2022	J	`jnl`	Localization with Few Distance Measurements. CoRR Dan Halperin, Steven M. LaValle, Barak Ugav
2022	J	`jnl`	Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead. ACM Trans. Algorithms Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer
2022	B	`conf`	Multi-Robot Motion Planning for Unit Discs with Revolving Areas. ISAAC Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor
2022	J	`jnl`	Multi-Robot Motion Planning for Unit Discs with Revolving Areas. CoRR Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor
2022	A	`conf`	Refined Hardness of Distance-Optimal Multi-Agent Path Finding. AAMAS Tzvika Geft, Dan Halperin
2022	J	`jnl`	Refined Hardness of Distance-Optimal Multi-Agent Path Finding. CoRR Tzvika Geft, Dan Halperin
2022	J	`jnl`	The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2022	A*	`conf`	Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. SoCG Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
2022	J	`jnl`	Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. CoRR Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
2021	J	`jnl`	Fast, High-Quality Two-Arm Rearrangement in Synchronous, Monotone Tabletop Setups. IEEE Trans Autom. Sci. Eng. Rahul Shome, Kiril Solovey, Jingjin Yu, Kostas E. Bekris, Dan Halperin
2021	A*	`conf`	Near-Optimal Multi-Robot Motion Planning with Finite Sampling. ICRA Dror Dayan, Kiril Solovey, Marco Pavone, Dan Halperin
2021	A*	`conf`	On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. SODA Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin
2021	J	`jnl`	On the Complexity of a Family of Decoupled Multi-Robot Motion Planning Problems. CoRR Tzvika Geft, Dan Halperin
2021	C	`conf`	Optimized Synthesis of Snapping Fixtures. WAFR Tom Tsabar, Efi Fogel, Dan Halperin
2021	C	`conf`	Space-Aware Reconfiguration. WAFR Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir
2021	A*	`conf`	Throwing a Sofa Through the Window. SoCG Dan Halperin, Micha Sharir, Itay Yehuda
2021	J	`jnl`	Throwing a Sofa Through the Window. CoRR Dan Halperin, Micha Sharir, Itay Yehuda
2020	J	`jnl`	Geometric Sparsification of Closeness Relations: Eigenvalue Clustering for Computing Matrix Functions. CoRR Nir Goren, Dan Halperin, Sivan Toledo
2020	J	`jnl`	Near-Optimal Multi-Robot Motion Planning with Finite Sampling. CoRR Dror Dayan, Kiril Solovey, Marco Pavone, Dan Halperin
2020	J	`jnl`	On Two-Handed Planar Assembly Partitioning. CoRR Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin
2020	A*	`conf`	Refined Analysis of Asymptotically-Optimal Kinodynamic Planning in the State-Cost Space. ICRA Michal Kleinbort, Edgar Granados, Kiril Solovey, Riccardo Bonalli, Kostas E. Bekris, Dan Halperin
2020	J	`jnl`	Robust 2D Assembly Sequencing via Geometric Planning with Learned Scores. CoRR Tzvika Geft, Aviv Tamar, Ken Goldberg, Dan Halperin
2020	J	`jnl`	Space-Aware Reconfiguration. CoRR Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir
2020	J	`jnl`	The Maximum-Level Vertex in an Arrangement of Lines. CoRR Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2020	J	`jnl`	dRRT Auton. Robots Rahul Shome, Kiril Solovey, Andrew Dobson, Dan Halperin, Kostas E. Bekris
2019	J	`jnl`	Dynamic Maintenance of the Lower Envelope of Pseudo-Lines. CoRR Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer
2019	A*	`conf`	Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead. SoCG Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer
2019	J	`jnl`	Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead. CoRR Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer
2019	J	`jnl`	Optimized Synthesis of Snapping Fixtures. CoRR Tom Tsabar, Efi Fogel, Dan Halperin
2019	J	`jnl`	Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning With Forward Propagation. IEEE Robotics Autom. Lett. Michal Kleinbort, Kiril Solovey, Zakary Littlefield, Kostas E. Bekris, Dan Halperin
2019	J	`jnl`	RRT2.0 for Fast and Optimal Kinodynamic Sampling-Based Motion Planning. CoRR Michal Kleinbort, Kiril Solovey, Riccardo Bonalli, Kostas E. Bekris, Dan Halperin
2019	—	`conf`	Robust 2D Assembly Sequencing via Geometric Planning with Learned Scores. CASE Tzvika Geft, Aviv Tamar, Ken Goldberg, Dan Halperin
2019	J	`jnl`	Sensory Regimes of Effective Distributed Searching without Leaders. CoRR Ravid Cohen, Yossi Yovel, Dan Halperin
2019	J	`jnl`	dRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning. CoRR Rahul Shome, Kiril Solovey, Andrew Dobson, Dan Halperin, Kostas E. Bekris
2018	J	`jnl`	Effective metrics for multi-robot motion-planning. Int. J. Robotics Res. Aviel Atias, Kiril Solovey, Oren Salzman, Dan Halperin
2018	J	`jnl`	Exact Minkowski sums of polygons with holes. Comput. Geom. Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr
2018	C	`conf`	Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups. WAFR Rahul Shome, Kiril Solovey, Jingjin Yu, Kostas E. Bekris, Dan Halperin
2018	J	`jnl`	Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups. CoRR Rahul Shome, Kiril Solovey, Jingjin Yu, Kostas E. Bekris, Dan Halperin
2018	C	`conf`	Motion Planning for Multiple Unit-Ball Robots in \(\mathbb {R}^{{\varvec{d}}}\). WAFR Israela Solomon, Dan Halperin
2018	J	`jnl`	Motion Planning for Multiple Unit-Ball Robots in ℝ CoRR Israela Solomon, Dan Halperin
2018	J	`jnl`	New perspective on sampling-based motion planning via random geometric graphs. Int. J. Robotics Res. Kiril Solovey, Oren Salzman, Dan Halperin
2018	J	`jnl`	Probabilistic completeness of RRT for geometric and kinodynamic planning with forward propagation. CoRR Michal Kleinbort, Kiril Solovey, Zakary Littlefield, Kostas E. Bekris, Dan Halperin
2017	—	`conf`	Effective Metrics for Multi-Robot Motion-Planning. Robotics: Science and Systems Aviel Atias, Kiril Solovey, Dan Halperin
2017	J	`jnl`	Effective Metrics for Multi-Robot Motion-Planning. CoRR Aviel Atias, Kiril Solovey, Dan Halperin
2017	A	`conf`	Efficient sampling-based bottleneck pathfinding over cost maps. IROS Kiril Solovey, Dan Halperin
2017	J	`jnl`	On the Separation of a Polyhedron from Its Single-Part Mold. CoRR Prosenjit Bose, Dan Halperin, Shahar Shamai
2017	—	`conf`	On the separation of a polyhedron from its single-part mold. CASE Prosenjit Bose, Dan Halperin, Shahar Shamai
2017	J	`jnl`	Scalable Asymptotically-Optimal Multi-Robot Motion Planning. CoRR Andrew Dobson, Kiril Solovey, Rahul Shome, Dan Halperin, Kostas E. Bekris
2017	—	`conf`	Scalable asymptotically-optimal multi-robot motion planning. MRS Andrew Dobson, Kiril Solovey, Rahul Shome, Dan Halperin, Kostas E. Bekris
2016	J	`jnl`	Asymptotically Near-Optimal RRT for Fast, High-Quality Motion Planning. IEEE Trans. Robotics Oren Salzman, Dan Halperin
2016	C	`conf`	Collision Detection or Nearest-Neighbor Search? On the Computational Bottleneck in Sampling-based Motion Planning. WAFR Michal Kleinbort, Oren Salzman, Dan Halperin
2016	J	`jnl`	Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning. CoRR Michal Kleinbort, Oren Salzman, Dan Halperin
2016	J	`jnl`	Efficient sampling-based bottleneck pathfinding over cost maps. CoRR Kiril Solovey, Dan Halperin
2016	—	`ch.`	Engineering Geometric Algorithms. Encyclopedia of Algorithms Dan Halperin
2016	J	`jnl`	Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning. Int. J. Robotics Res. Kiril Solovey, Oren Salzman, Dan Halperin
2016	J	`jnl`	Motion Planning for Multilink Robots by Implicit Configuration-Space Tiling. IEEE Robotics Autom. Lett. Oren Salzman, Kiril Solovey, Dan Halperin
2016	—	`conf`	New perspective on sampling-based motion planning via random geometric graphs. Robotics: Science and Systems Kiril Solovey, Oren Salzman, Dan Halperin
2016	J	`jnl`	New perspective on sampling-based motion planning via random geometric graphs. CoRR Kiril Solovey, Oren Salzman, Dan Halperin
2016	J	`jnl`	On the hardness of unlabeled multi-robot motion planning. Int. J. Robotics Res. Kiril Solovey, Dan Halperin
2016	J	`jnl`	Optimal randomized incremental construction for guaranteed logarithmic planar point location. Comput. Geom. Michael Hemmer, Michal Kleinbort, Dan Halperin
2016	A	`conf`	Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching. ESA Kiril Solovey, Dan Halperin
2016	J	`jnl`	Sampling-based bottleneck pathfinding with applications to Frechet matching. CoRR Kiril Solovey, Dan Halperin
2015	A*	`conf`	Asymptotically-optimal Motion Planning using lower bounds on cost. ICRA Oren Salzman, Dan Halperin
2015	J	`jnl`	Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons. IEEE Trans Autom. Sci. Eng. Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey
2015	A*	`conf`	Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. ICRA Michal Kleinbort, Oren Salzman, Dan Halperin
2015	A	`conf`	Exact Minkowski Sums of Polygons With Holes. ESA Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr
2015	J	`jnl`	Exact Minkowski Sums of Polygons With Holes. CoRR Alon Baram, Efi Fogel, Michael Hemmer, Dan Halperin, Sebastian Morr
2015	J	`jnl`	Motion Planning for Multi-Link Robots by Implicit Configuration-Space Tiling. CoRR Oren Salzman, Kiril Solovey, Dan Halperin
2015	—	`conf`	Motion Planning for Unlabeled Discs with Optimality Guarantees. Robotics: Science and Systems Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin
2015	J	`jnl`	Motion Planning for Unlabeled Discs with Optimality Guarantees. CoRR Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin
2015	J	`jnl`	On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. IEEE Trans Autom. Sci. Eng. Oren Salzman, Michael Hemmer, Dan Halperin
2015	—	`conf`	On the hardness of unlabeled multi-robot motion planning. Robotics: Science and Systems Kiril Solovey, Dan Halperin
2015	A*	`conf`	Optimal motion planning for a tethered robot: Efficient preprocessing for fast shortest paths queries. ICRA Oren Salzman, Dan Halperin
2015	—	`conf`	Real-time collision detection for multiple packaging robots using monotonicity of configuration subspaces. CASE Ronald van Zon, Diego Escudero, Dan Halperin, Igor Jovanovic, Raffaelle Vito, Rodrigo I. Silveira, Kevin Buchin
2015	A	`conf`	The Offset Filtration of Convex Objects. ESA Dan Halperin, Michael Kerber, Doron Shaharabani
2014	J	`jnl`	Asymptotically Near-Optimal Motion Planning using Lower Bounds on Cost. CoRR Oren Salzman, Dan Halperin
2014	A*	`conf`	Asymptotically near-optimal RRT for fast, high-quality, motion planning. ICRA Oren Salzman, Dan Halperin
2014	C	`conf`	Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons. WAFR Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey
2014	J	`jnl`	Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. CoRR Michal Kleinbort, Oren Salzman, Dan Halperin
2014	C	`conf`	Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-robot Motion Planning. WAFR Kiril Solovey, Oren Salzman, Dan Halperin
2014	J	`jnl`	Optimal randomized incremental construction for guaranteed logarithmic planar point location. CoRR Michael Hemmer, Michal Kleinbort, Dan Halperin
2014	J	`jnl`	PSPACE-hardness of unlabeled motion planning and variants. CoRR Kiril Solovey, Dan Halperin
2014	J	`jnl`	Sparsification of motion-planning roadmaps by edge contraction. Int. J. Robotics Res. Oren Salzman, Doron Shaharabani, Pankaj K. Agarwal, Dan Halperin
2014	J	`jnl`	The Offset Filtration of Convex Objects. CoRR Dan Halperin, Michael Kerber, Doron Shaharabani
2013	J	`jnl`	Asymptotically near-optimal RRT for fast, high-quality, motion planning. CoRR Oren Salzman, Dan Halperin
2013	J	`jnl`	Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons. CoRR Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey
2013	J	`jnl`	Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-Robot Motion Planning CoRR Kiril Solovey, Oren Salzman, Dan Halperin
2013	J	`jnl`	Motion Planning via Manifold Samples. Algorithmica Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin
2013	J	`jnl`	Polyhedral Assembly Partitioning With Infinite Translations or The Importance of Being Exact. IEEE Trans Autom. Sci. Eng. Efi Fogel, Dan Halperin
2013	A*	`conf`	Sparsification of motion-planning roadmaps by edge contraction. ICRA Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal, Dan Halperin
2012	—	`book`	CGAL Arrangements and Their Applications - A Step-by-Step Guide. Efi Fogel, Dan Halperin, Ron Wein
2012	J	`jnl`	Deconstructing Approximate Offsets. Discret. Comput. Geom. Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova
2012	J	`jnl`	Improved Implementation of Point Location in General Two-Dimensional Subdivisions CoRR Michael Hemmer, Michal Kleinbort, Dan Halperin
2012	A	`conf`	Improved Implementation of Point Location in General Two-Dimensional Subdivisions. ESA Michael Hemmer, Michal Kleinbort, Dan Halperin
2012	J	`jnl`	Introduction to special issue ALENEX'10. ACM J. Exp. Algorithmics Guy E. Blelloch, Dan Halperin
2012	A	`conf`	Lines through Segments in 3D Space. ESA Efi Fogel, Michael Hemmer, Asaf Porat, Dan Halperin
2012	J	`jnl`	On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages CoRR Oren Salzman, Michael Hemmer, Dan Halperin
2012	C	`conf`	On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. WAFR Oren Salzman, Michael Hemmer, Dan Halperin
2012	J	`jnl`	Sparsification of Motion-Planning Roadmaps by Edge Contraction CoRR Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal, Dan Halperin
2012	J	`jnl`	k-Color Multi-Robot Motion Planning CoRR Kiril Solovey, Dan Halperin
2012	C	`conf`	k-Color Multi-robot Motion Planning. WAFR Kiril Solovey, Dan Halperin
2011	J	`jnl`	A Little More, a Lot Better: Improving Path Quality by a Path-Merging Algorithm. IEEE Trans. Robotics Barak Raveh, Angela Enosh, Dan Halperin
2011	J	`jnl`	Deconstructing Approximate Offsets CoRR Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova
2011	—	`conf`	Deconstructing approximate offsets. SCG Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova
2011	J	`jnl`	Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. Comput. Aided Des. Naama Mayer, Efi Fogel, Dan Halperin
2011	J	`jnl`	Guest Editorial: Selected Papers from European Symposium on Algorithms. Algorithmica Dan Halperin, Kurt Mehlhorn
2011	J	`jnl`	Motion Planning via Manifold Samples CoRR Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin
2011	A	`conf`	Motion Planning via Manifold Samples. ESA Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin
2010	J	`jnl`	A Little More, a Lot Better: Improving Path Quality by a Simple Path Merging Algorithm CoRR Barak Raveh, Angela Enosh, Dan Halperin
2010	J	`jnl`	Approximating the Pathway Axis and the Persistence Diagrams for a Collection of Balls in 3-Space. Discret. Comput. Geom. Eitan Yaffe, Dan Halperin
2010	J	`jnl`	Arrangements on Parametric Surfaces I: General Framework and Infrastructure. Math. Comput. Sci. Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
2010	J	`jnl`	Arrangements on Parametric Surfaces II: Concretizations and Applications. Math. Comput. Sci. Eric Berberich, Efi Fogel, Dan Halperin, Michael Kerber, Ophir Setter
2010	J	`jnl`	Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. Trans. Comput. Sci. Ophir Setter, Micha Sharir, Dan Halperin
2010	—	`conf`	Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Point-Location. ESA (1) Michael Hemmer, Ophir Setter, Dan Halperin
2010	—	`conf`	Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic. ICMS Dan Halperin
2010	—	`conf`	Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. Symposium on Solid and Physical Modeling Naama Mayer, Efi Fogel, Dan Halperin
2010	J	`jnl`	Improving the Quality of Non-Holonomic Motion by Hybridizing C-PRM Paths CoRR Itamar Berger, Bosmat Eldar, Gal Zohar, Barak Raveh, Dan Halperin
2010	A	`ed.`	Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX 2010, Austin, Texas, USA, January 16, 2010 ALENEX Guy E. Blelloch, Dan Halperin
2010	C	`conf`	Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners. WAFR Oren Nechushtan, Barak Raveh, Dan Halperin
2009	—	`conf`	Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. ISVD Ophir Setter, Micha Sharir, Dan Halperin
2009	J	`jnl`	On the Exact Maximum Complexity of Minkowski Sums of Polytopes. Discret. Comput. Geom. Efi Fogel, Dan Halperin, Christophe Weibel
2009	J	`jnl`	Rapid Sampling of Molecular Motions with Prior Information Constraints. PLoS Comput. Biol. Barak Raveh, Angela Enosh, Ora Schueler-Furman, Dan Halperin
2008	A	`ed.`	Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings ESA Dan Halperin, Kurt Mehlhorn
2008	J	`jnl`	An experimental study of point location in planar arrangements in CGAL. ACM J. Exp. Algorithmics Idit Haran, Dan Halperin
2008	—	`conf`	Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space. SCG Eitan Yaffe, Dan Halperin
2008	—	`conf`	Arrangements of geodesic arcs on the sphere. SCG Efi Fogel, Ophir Setter, Dan Halperin
2008	—	`ch.`	Engineering Geometric Algorithms. Encyclopedia of Algorithms Dan Halperin
2008	J	`jnl`	MolAxis: a server for identification of channels in macromolecules. Nucleic Acids Res. Eitan Yaffe, Dan Fishelovitch, Haim J. Wolfson, Dan Halperin, Ruth Nussinov
2008	J	`jnl`	Planning High-quality Paths and Corridors Amidst Obstacles. Int. J. Robotics Res. Ron Wein, Jur P. van den Berg, Dan Halperin
2008	C	`conf`	Polyhedral Assembly Partitioning with Infinite Translations or WAFR Efi Fogel, Dan Halperin
2008	—	`conf`	The complexity of the outer face in arrangements of random segments. SCG Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir
2007	J	`jnl`	Advanced programming techniques applied to Cgal's arrangement package. Comput. Geom. Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin
2007	J	`jnl`	An intersection-sensitive algorithm for snap rounding. Comput. Geom. Mark de Berg, Dan Halperin, Mark H. Overmars
2007	J	`jnl`	Exact and efficient construction of Minkowski sums of convex polyhedra with applications. Comput. Aided Des. Efi Fogel, Dan Halperin
2007	—	`conf`	On the exact maximum complexity of Minkowski sums of convex polyhedra. SCG Efi Fogel, Dan Halperin, Christophe Weibel
2007	J	`jnl`	Prediction and simulation of motion in pairs of transmembrane alpha-helices. Bioinform. Angela Enosh, Sarel Jacob Fleishman, Nir Ben-Tal, Dan Halperin
2007	A	`conf`	Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
2007	J	`jnl`	The visibility-Voronoi complex and its applications. Comput. Geom. Ron Wein, Jur P. van den Berg, Dan Halperin
2006	A	`conf`	An Experimental Study of Point Location in General Planar Arrangements. ALENEX Idit Haran, Dan Halperin
2006	A	`conf`	Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications. ALENEX Efi Fogel, Dan Halperin
2006	C	`conf`	Planning Near-Optimal Corridors Amidst Obstacles. WAFR Ron Wein, Jur P. van den Berg, Dan Halperin
2005	J	`jnl`	Continuous Path Verification in Multi-axis Nc-machining. Int. J. Comput. Geom. Appl. Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin
2005	—	`conf`	Dynamic maintenance of molecular surfaces under conformational changes. SCG Eran Eyal, Dan Halperin
2005	—	`conf`	Exact Minkowski sums of convex polyhedra. SCG Efi Fogel, Dan Halperin
2005	C	`conf`	Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity. WABI Eran Eyal, Dan Halperin
2005	J	`jnl`	Precise global collision detection in multi-axis NC-machining. Comput. Aided Des. Oleg Ilushin, Gershon Elber, Dan Halperin, Ron Wein, Myung-Soo Kim
2005	—	`conf`	The Visibility-Voronoi Complex and Its Applications. SCG Ron Wein, Jur P. van den Berg, Dan Halperin
2005	C	`conf`	The visibility-Voronoi complex and its applications. EuroCG Ron Wein, Jur P. van den Berg, Dan Halperin
2004	J	`jnl`	Algorithm and Data Structures for Efficient Energy Maintenance during Monte Carlo Simulation of Proteins. J. Comput. Biol. Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe
2004	—	`ch.`	Arrangements. Handbook of Discrete and Computational Geometry, 2nd Ed. Dan Halperin
2004	—	`conf`	Assigning transmembrane segments to helices in intermediate-resolution structures. ISMB/ECCB (Supplement of Bioinformatics) Angela Enosh, Sarel Jacob Fleishman, Nir Ben-Tal, Dan Halperin
2004	A	`conf`	Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements. ESA Efi Fogel, Ron Wein, Dan Halperin
2004	—	`conf`	Continuous path verification in multi-axis NC-machining. SCG Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin
2004	J	`jnl`	Controlled perturbation for arrangements of circles. Int. J. Comput. Geom. Appl. Dan Halperin, Eran Leiserowitz
2004	—	`conf`	Engineering Geometric Algorithms: Persistent Problems and Some Solutions (Abstract of invited talk). ALENEX/ANALC Dan Halperin
2004	—	`ch.`	Robotics. Handbook of Discrete and Computational Geometry, 2nd Ed. Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe
2004	J	`jnl`	Speeding up the incremental construction of the union of geometric objects in practice. Comput. Geom. Eti Ezra, Dan Halperin, Micha Sharir
2003	J	`jnl`	An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane. Int. J. Comput. Geom. Appl. Chaim Linhart, Dan Halperin, Iddo Hanniel, Sariel Har-Peled
2003	—	`conf`	Controlled perturbation for arrangements of circles. SCG Dan Halperin, Eran Leiserowitz
2002	—	`conf`	Efficient maintenance and self-collision testing for Kinematic Chains. SCG Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe
2002	—	`conf`	Exact minkowski sums and applications. SCG Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz
2002	C	`conf`	Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane. WAFR Shai Hirsch, Dan Halperin
2002	—	`conf`	Improved construction of vertical decompositions of three-dimensional arrangements. SCG Hayim Shaul, Dan Halperin
2002	J	`jnl`	Iterated snap rounding. Comput. Geom. Dan Halperin, Eli Packer
2002	J	`jnl`	Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. Pankaj K. Agarwal, Eyal Flato, Dan Halperin
2002	J	`jnl`	Robust Geometric Computing in Motion. Int. J. Robotics Res. Dan Halperin
2002	J	`jnl`	Separating an object from its cast. Comput. Aided Des. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
2002	A	`conf`	Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. ESA Eti Ezra, Dan Halperin, Micha Sharir
2002	J	`jnl`	The 2-Center Problem with Obstacles. J. Algorithms Dan Halperin, Micha Sharir, Kenneth Y. Goldberg
2001	J	`jnl`	Guest Editors' Foreword. Discret. Comput. Geom. Pankaj K. Agarwal, Dan Halperin, Richard Pollack
2001	J	`jnl`	On the Number of Regular Vertices of the Union of Jordan Regions. Discret. Comput. Geom. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir
2000	J	`jnl`	A General Framework for Assembly Planning: The Motion Space Approach. Algorithmica Dan Halperin, Jean-Claude Latombe, Randall H. Wilson
2000	—	`conf`	On the Number of Views of Polyhedral Scenes. JCDCG Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer
2000	A	`conf`	Polygon Decomposition for Efficient Construction of Minkowski Sums. ESA Pankaj K. Agarwal, Eyal Flato, Dan Halperin
2000	C	`conf`	Robust and Efficient Construction of Planar Minkowski Sums. EuroCG Eyal Flato, Dan Halperin
2000	—	`conf`	The 2-center problem with obstacles. SCG Dan Halperin, Micha Sharir, Kenneth Y. Goldberg
2000	J	`jnl`	The Design and Implementation of Planar Maps in CGAL. ACM J. Exp. Algorithmics Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra
2000	—	`conf`	Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves. WAE Iddo Hanniel, Dan Halperin
1999	J	`jnl`	On the Area Bisectors of a Polygon. Discret. Comput. Geom. Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin
1999	—	`conf`	On-Line Zone Construction in Arrangements of Lines in the Plane. WAE Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart
1999	—	`ch.`	Robot Algorithms. Algorithms and Theory of Computation Handbook Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe
1999	—	`conf`	The Design and Implementation of Planar Maps in CGAL. WAE Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan
1999	—	`conf`	Tutorial 9 - Visibility. Eurographics (Tutorials) 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
1998	—	`conf`	A General Framework for Assembly Planning: The Motion Space Approach. SCG Dan Halperin, Jean-Claude Latombe, Randall H. Wilson
1998	J	`jnl`	A perturbation scheme for spherical arrangements with application to molecular modeling. Comput. Geom. Dan Halperin, Christian R. Shelton
1998	J	`jnl`	Combinatorial complexity of translating a box in polyhedral 3-space. Comput. Geom. Dan Halperin, Chee-Keng Yap
1998	J	`jnl`	Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes. Comput. Graph. Forum Daniel Cohen-Or, Gadi Fibich, Dan Halperin, Eyal Zadicario
1998	—	`conf`	On the Number of Regular Vertices of the Union of Jordan Regions. SWAT Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir
1998	J	`jnl`	Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes. Int. J. Comput. Geom. Appl. Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukawa, Jean-Claude Latombe, Randall H. Wilson
1998	J	`jnl`	Spheres, molecules, and hidden surface removal. Comput. Geom. Dan Halperin, Mark H. Overmars
1998	A*	`conf`	The Dynamic Servers Problem. SODA Moses Charikar, Dan Halperin, Rajeev Motwani
1997	—	`conf`	A Perturbation Scheme for Spherical Arrangements with Application to Molecular Modeling. SCG Dan Halperin, Christian R. Shelton
1997	—	`conf`	Separating an Object from its Cast. SCG Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
1997	J	`jnl`	Sparse Arrangements and the Number of Views of Polyhedral Scenes. Int. J. Comput. Geom. Appl. Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld
1997	—	`conf`	The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields. SCG Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin
1996	J	`jnl`	A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. Discret. Comput. Geom. Dan Halperin, Micha Sharir
1996	J	`jnl`	Assembly partitioning along simple paths: the case of multiple translations. Adv. Robotics Dan Halperin, Randall H. Wilson
1996	A*	`conf`	Efficient Generation of k-Directional Assembly Sequences. SODA Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir
1996	—	`conf`	Geometric Manipulation of Flexible Ligands. WACG Paul W. Finn, Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian
1996	J	`jnl`	Vertical Decompositions for Triangles in 3-Space. Discret. Comput. Geom. Mark de Berg, Leonidas J. Guibas, Dan Halperin
1995	A*	`conf`	A Simple and Effeicient Procedure for Polyhedral Assembly Partitioning under Infinitesimal Motions. ICRA Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukawa, Jean-Claude Latombe, Randall H. Wilson
1995	J	`jnl`	Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Discret. Comput. Geom. Dan Halperin, Micha Sharir
1995	J	`jnl`	Arrangements of Segments that Share Endpoints Single Face Results. Discret. Comput. Geom. Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor
1995	A*	`conf`	Assembly Partitioning along Simple Paths: the Case of Multiple Translations. ICRA Dan Halperin, Randall H. Wilson
1995	J	`jnl`	Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud
1995	—	`conf`	The complexity of a single face of a minkowski sum. CCCG Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink
1995	J	`jnl`	Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discret. Comput. Geom. Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
1994	—	`conf`	Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. SCG Dan Halperin, Micha Sharir
1994	J	`jnl`	Efficient Ray Shooting and Hidden Surface Removal. Algorithmica Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
1994	J	`jnl`	New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. Discret. Comput. Geom. Dan Halperin, Micha Sharir
1994	J	`jnl`	On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. Dan Halperin, Micha Sharir
1994	J	`jnl`	On the Complexity of a Single Cell in Certain Arrangement of Surfaces Related to Motion Planning. Discret. Comput. Geom. Dan Halperin
1994	J	`jnl`	Robot motion planning and the single cell problem in arrangements. J. Intell. Robotic Syst. Dan Halperin
1994	—	`conf`	Spheres, Molecules, and Hidden Surface Removal. SCG Dan Halperin, Mark H. Overmars
1994	—	`conf`	Vertical Decompositions for Triangles in 3-Space. SCG Mark de Berg, Leonidas J. Guibas, Dan Halperin
1993	—	`conf`	Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. SCG Dan Halperin, Chee-Keng Yap
1993	—	`conf`	Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. ICRA (1) A. Frank van der Stappen, Dan Halperin, Mark H. Overmars
1993	A*	`conf`	Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment FOCS Dan Halperin, Micha Sharir
1993	—	`conf`	New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. SCG Dan Halperin, Micha Sharir
1993	—	`conf`	On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
1993	B	`conf`	Reaching a Goal with Directional Uncertainty. ISAAC Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
1993	J	`jnl`	The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles. Comput. Geom. A. Frank van der Stappen, Dan Halperin, Mark H. Overmars
1992	—	`—`	Algorithmic motion planning via arrangements of curves and of surfaces Dan Halperin
1992	J	`jnl`	Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. Dan Halperin, Mark H. Overmars, Micha Sharir
1991	—	`conf`	Arrangements of Segments that Share Endpoints: Single Face Results. SCG Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor
1991	—	`conf`	Efficient Ray Shooting and Hidden Surface Removal. SCG Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
1991	J	`jnl`	Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom. Comput. Geom. Dan Halperin, Micha Sharir
1991	J	`jnl`	On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. Dan Halperin, Micha Sharir
1991	—	`conf`	On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract). SCG Dan Halperin
1989	—	`conf`	Efficient Motion Planning for an L-Shaped Object. SCG Dan Halperin, Mark H. Overmars