Dan Halperin

From MaRDI portal
Person:238435

Available identifiers

zbMath Open halperin.danMaRDI QIDQ238435

List of research outcomes





PublicationDate of PublicationType
Near-optimal min-sum motion planning for two square robots in a polygonal environment2024-11-28Paper
Optimal algorithms for separating a polyhedron from its single-part mold2024-11-18Paper
Multi-robot motion planning for unit discs with revolving areas2024-09-11Paper
Unlabeled multi-robot motion planning with tighter separation bounds2024-05-14Paper
Shortest coordinated motion for square robots2024-01-16Paper
https://portal.mardi4nfdi.de/entity/Q61473602024-01-15Paper
Throwing a sofa through the window2023-12-21Paper
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead2023-10-31Paper
Multi-robot motion planning for unit discs with revolving areas2023-07-31Paper
Space-aware reconfiguration2023-05-12Paper
On the number of regular vertices of the union of Jordan regions2022-12-09Paper
Area Optimal Polygonization Using Simulated Annealing2022-09-06Paper
https://portal.mardi4nfdi.de/entity/Q50889552022-07-18Paper
The maximum-level vertex in an arrangement of lines2022-03-21Paper
Space-Aware Reconfiguration2021-09-20Paper
Optimized Synthesis of Snapping Fixtures2021-09-20Paper
Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications2019-09-11Paper
Efficient maintenance and self-collision testing for Kinematic Chains2018-11-23Paper
Improved construction of vertical decompositions of three-dimensional arrangements2018-11-23Paper
Exact Minkowski sums of polygons with holes2018-10-31Paper
https://portal.mardi4nfdi.de/entity/Q46063512018-03-02Paper
The visibility--voronoi complex and its applications2017-10-20Paper
Dynamic maintenance of molecular surfaces under conformational changes2017-10-20Paper
Controlled perturbation for arrangements of circles2017-09-29Paper
Continuous path verification in multi-axis NC-machining2017-09-29Paper
The 2-center problem with obstacles2017-09-29Paper
Optimal randomized incremental construction for guaranteed logarithmic planar point location2016-11-14Paper
New perspective on sampling-based motion planning via random geometric graphs2016-02-17Paper
Exact Minkowski sums of polygons with holes2015-11-19Paper
The Offset Filtration of Convex Objects2015-11-19Paper
Motion planning via manifold samples2015-03-23Paper
An experimental study of point location in planar arrangements in CGAL2014-04-01Paper
Deconstructing approximate offsets2014-03-24Paper
Deconstructing approximate offsets2013-01-11Paper
Improved Implementation of Point Location in General Two-Dimensional Subdivisions2012-09-25Paper
Lines through Segments in 3D Space2012-09-25Paper
Motion planning via manifold samples2011-09-16Paper
Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners2011-08-04Paper
Exact and efficient construction of Minkowski sums of convex polyhedra with applications2011-03-04Paper
Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact2011-03-02Paper
Arrangements on parametric surfaces. I: General framework and infrastructure2011-02-19Paper
Arrangements on parametric surfaces. II: Concretizations and applications2011-02-19Paper
CGAL Arrangements and their applications. A step-by-step guide2011-02-16Paper
Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space2010-11-08Paper
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space2010-11-02Paper
Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic2010-09-14Paper
Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space2010-09-06Paper
Planning Near-Optimal Corridors Amidst Obstacles2010-06-02Paper
On the exact maximum complexity of Minkowski sums of polytopes2009-12-14Paper
Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space2009-02-12Paper
Arrangements of geodesic arcs on the sphere2009-02-12Paper
The complexity of the outer face in arrangements of random segments2009-02-12Paper
On the exact maximum complexity of Minkowski sums of convex polyhedra2009-02-12Paper
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step2008-09-25Paper
Advanced programming techniques applied to CGAL's arrangement package2007-07-04Paper
Arrangements2007-06-19Paper
The visibility-Voronoi complex and its applications2007-03-12Paper
An intersection-sensitive algorithm for snap rounding2007-02-19Paper
CONTINUOUS PATH VERIFICATION IN MULTI-AXIS NC-MACHINING2005-09-29Paper
Algorithms – ESA 20042005-08-18Paper
The design and implementation of panar maps in CGAL2005-08-04Paper
AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE2005-03-30Paper
CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES2004-11-01Paper
Speeding up the incremental construction of the union of geometric objects in practice.2004-01-23Paper
Robust geometric computing in motion2003-08-28Paper
https://portal.mardi4nfdi.de/entity/Q44113842003-07-08Paper
Iterated snap rounding2003-03-10Paper
On the number of regular vertices of the union of Jordan regions2002-11-04Paper
The 2-center problem with obstacles2002-10-02Paper
https://portal.mardi4nfdi.de/entity/Q45477932002-08-21Paper
Polygon decomposition for efficient construction of Minkowski sums2002-03-14Paper
https://portal.mardi4nfdi.de/entity/Q27539192001-12-18Paper
https://portal.mardi4nfdi.de/entity/Q44999512000-11-26Paper
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes2000-11-07Paper
https://portal.mardi4nfdi.de/entity/Q42502082000-06-21Paper
A general framework for assembly planning: The motion space approach2000-05-07Paper
https://portal.mardi4nfdi.de/entity/Q44010311999-11-08Paper
On the area bisectors of a polygon1999-09-12Paper
https://portal.mardi4nfdi.de/entity/Q44010111999-03-02Paper
Spheres, molecules, and hidden surface removal1998-12-21Paper
A perturbation scheme for spherical arrangements with application to molecular modeling1998-09-28Paper
Combinatorial complexity of translating a box in polyhedral 3-space1998-08-30Paper
Reaching a goal with directional uncertainty1997-02-28Paper
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment1996-10-13Paper
Almost tight upper bounds for the single cell and zone problems in the three dimensions1996-06-23Paper
https://portal.mardi4nfdi.de/entity/Q48751761996-04-28Paper
https://portal.mardi4nfdi.de/entity/Q48486101996-03-27Paper
Vertical decompositions for triangles in 3-space1996-02-13Paper
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains1995-08-27Paper
Vertical decomposition of arrangements of hyperplanes in four dimensions1995-08-13Paper
Arrangements of segments that share endpoints: Single face results1995-07-02Paper
Robot motion planning and the single cell problem in arrangements1995-04-20Paper
Efficient ray shooting and hidden surface removal1994-08-10Paper
Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines1994-08-03Paper
On the complexity of a single cell in certain arrangements of surfaces related to motion planning1994-07-28Paper
The complexity of the free space for a robot moving amidst fat obstacles1994-02-17Paper
Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom1992-09-27Paper
Efficient Motion Planning for an L-Shaped Object1992-06-28Paper
On disjoint concave chains in arrangements of (pseudo) lines1992-06-28Paper

Research outcomes over time

This page was built for person: Dan Halperin