The following pages link to Dan Halperin (Q238435):
Displaying 50 items.
- (Q178849) (redirect page) (← links)
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space (Q603856) (← links)
- CGAL Arrangements and their applications. A step-by-step guide (Q625322) (← links)
- Arrangements on parametric surfaces. I: General framework and infrastructure (Q626974) (← links)
- Arrangements on parametric surfaces. II: Concretizations and applications (Q626976) (← links)
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications (Q628176) (← links)
- Reaching a goal with directional uncertainty (Q673767) (← links)
- An intersection-sensitive algorithm for snap rounding (Q868103) (← links)
- The visibility-Voronoi complex and its applications (Q870429) (← links)
- On the exact maximum complexity of Minkowski sums of polytopes (Q1042457) (← links)
- On disjoint concave chains in arrangements of (pseudo) lines (Q1183468) (← links)
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) (← links)
- A perturbation scheme for spherical arrangements with application to molecular modeling (Q1265287) (← links)
- Spheres, molecules, and hidden surface removal (Q1272310) (← links)
- On the area bisectors of a polygon (Q1302045) (← links)
- On the complexity of a single cell in certain arrangements of surfaces related to motion planning (Q1314439) (← links)
- The complexity of the free space for a robot moving amidst fat obstacles (Q1314536) (← links)
- Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines'' (Q1328765) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains (Q1338959) (← links)
- Combinatorial complexity of translating a box in polyhedral 3-space (Q1384201) (← links)
- Speeding up the incremental construction of the union of geometric objects in practice. (Q1421031) (← links)
- Exact Minkowski sums of polygons with holes (Q1615780) (← links)
- Robot motion planning and the single cell problem in arrangements (Q1842755) (← links)
- Iterated snap rounding (Q1862124) (← links)
- Arrangements of segments that share endpoints: Single face results (Q1892408) (← links)
- Vertical decomposition of arrangements of hyperplanes in four dimensions (Q1895966) (← links)
- Almost tight upper bounds for the single cell and zone problems in the three dimensions (Q1906044) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment (Q1923770) (← links)
- Deconstructing approximate offsets (Q1930550) (← links)
- A general framework for assembly planning: The motion space approach (Q1974473) (← links)
- Motion planning via manifold samples (Q2017878) (← links)
- The maximum-level vertex in an arrangement of lines (Q2117347) (← links)
- Advanced programming techniques applied to CGAL's arrangement package (Q2371336) (← links)
- (Q2749763) (← links)
- (Q2753919) (← links)
- The 2-Center Problem with Obstacles (Q2777608) (← links)
- Lines through Segments in 3D Space (Q2912865) (← links)
- Improved Implementation of Point Location in General Two-Dimensional Subdivisions (Q2912879) (← links)
- Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners (Q3020419) (← links)
- Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space (Q3052755) (← links)
- Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact (Q3079492) (← links)
- Space-Aware Reconfiguration (Q3381950) (← links)
- Optimized Synthesis of Snapping Fixtures (Q3381958) (← links)
- The Offset Filtration of Convex Objects (Q3452834) (← links)
- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step (Q3527254) (← links)
- Planning Near-Optimal Corridors Amidst Obstacles (Q3564334) (← links)
- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space (Q3586480) (← links)
