| Publication | Date of Publication | Type |
|---|
| Near-optimal min-sum motion planning for two square robots in a polygonal environment | 2024-11-28 | Paper |
Optimal algorithms for separating a polyhedron from its single-part mold
CGT. Computing in Geometry and Topology | 2024-11-18 | Paper |
| Multi-robot motion planning for unit discs with revolving areas | 2024-09-11 | Paper |
| Unlabeled multi-robot motion planning with tighter separation bounds | 2024-05-14 | Paper |
Shortest coordinated motion for square robots
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788443 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Throwing a sofa through the window
Discrete & Computational Geometry | 2023-12-21 | Paper |
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Multi-robot motion planning for unit discs with revolving areas
Computational Geometry | 2023-07-31 | Paper |
Space-aware reconfiguration
Discrete & Computational Geometry | 2023-05-12 | Paper |
On the number of regular vertices of the union of Jordan regions
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Area optimal polygonization using simulated annealing
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
scientific article; zbMATH DE number 7559226 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
The maximum-level vertex in an arrangement of lines
Discrete & Computational Geometry | 2022-03-21 | Paper |
Space-aware reconfiguration
Algorithmic Foundations of Robotics XIV | 2021-09-20 | Paper |
Optimized synthesis of snapping fixtures
Algorithmic Foundations of Robotics XIV | 2021-09-20 | Paper |
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Efficient maintenance and self-collision testing for kinematic chains
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Improved construction of vertical decompositions of three-dimensional arrangements
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Exact Minkowski sums of polygons with holes
Computational Geometry | 2018-10-31 | Paper |
Sampling-based bottleneck pathfinding with applications to Fréchet matching
(available as arXiv preprint) | 2018-03-02 | Paper |
The visibility-Voronoi complex and its applications
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Dynamic maintenance of molecular surfaces under conformational changes
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Controlled perturbation for arrangements of circles
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Continuous path verification in multi-axis NC-machining
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Optimal randomized incremental construction for guaranteed logarithmic planar point location
Computational Geometry | 2016-11-14 | Paper |
| New perspective on sampling-based motion planning via random geometric graphs | 2016-02-17 | Paper |
The Offset Filtration of Convex Objects
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Exact Minkowski sums of polygons with holes
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Motion planning via manifold samples
Algorithmica | 2015-03-23 | Paper |
An experimental study of point location in planar arrangements in CGAL
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Deconstructing approximate offsets
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Deconstructing approximate offsets
Discrete & Computational Geometry | 2013-01-11 | Paper |
Improved implementation of point location in general two-dimensional subdivisions
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Lines through segments in 3D space
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Motion planning via manifold samples
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Sampling-diagram automata: a tool for analyzing path quality in tree planners
Springer Tracts in Advanced Robotics | 2011-08-04 | Paper |
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
CAD. Computer-Aided Design | 2011-03-04 | Paper |
Polyhedral assembly partitioning with infinite translations or the importance of being exact
Springer Tracts in Advanced Robotics | 2011-03-02 | Paper |
Arrangements on parametric surfaces. I: General framework and infrastructure
Mathematics in Computer Science | 2011-02-19 | Paper |
Arrangements on parametric surfaces. II: Concretizations and applications
Mathematics in Computer Science | 2011-02-19 | Paper |
CGAL Arrangements and their applications. A step-by-step guide
Geometry and Computing | 2011-02-16 | Paper |
Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space
Discrete & Computational Geometry | 2010-11-08 | Paper |
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on Computational Science IX | 2010-11-02 | Paper |
Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic
Mathematical Software – ICMS 2010 | 2010-09-14 | Paper |
Constructing the exact Voronoi diagram of arbitrary lines in three-dimensional space. With fast point-location
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Planning near-optimal corridors amidst obstacles
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
On the exact maximum complexity of Minkowski sums of polytopes
Discrete & Computational Geometry | 2009-12-14 | Paper |
Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Arrangements of geodesic arcs on the sphere
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
The complexity of the outer face in arrangements of random segments
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
On the exact maximum complexity of Minkowski sums of convex polyhedra
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Advanced programming techniques applied to CGAL's arrangement package
Computational Geometry | 2007-07-04 | Paper |
| Arrangements | 2007-06-19 | Paper |
The visibility-Voronoi complex and its applications
Computational Geometry | 2007-03-12 | Paper |
An intersection-sensitive algorithm for snap rounding
Computational Geometry | 2007-02-19 | Paper |
CONTINUOUS PATH VERIFICATION IN MULTI-AXIS NC-MACHINING
International Journal of Computational Geometry & Applications | 2005-09-29 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
The design and implementation of panar maps in CGAL
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE
International Journal of Computational Geometry & Applications | 2005-03-30 | Paper |
CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
International Journal of Computational Geometry & Applications | 2004-11-01 | Paper |
Speeding up the incremental construction of the union of geometric objects in practice.
Computational Geometry | 2004-01-23 | Paper |
| Robust geometric computing in motion | 2003-08-28 | Paper |
| scientific article; zbMATH DE number 1947415 (Why is no real title available?) | 2003-07-08 | Paper |
Iterated snap rounding
Computational Geometry | 2003-03-10 | Paper |
On the number of regular vertices of the union of Jordan regions
Discrete & Computational Geometry | 2002-11-04 | Paper |
The 2-center problem with obstacles
Journal of Algorithms | 2002-10-02 | Paper |
| scientific article; zbMATH DE number 1786501 (Why is no real title available?) | 2002-08-21 | Paper |
Polygon decomposition for efficient construction of Minkowski sums
Computational Geometry | 2002-03-14 | Paper |
| scientific article; zbMATH DE number 1670643 (Why is no real title available?) | 2001-12-18 | Paper |
| scientific article; zbMATH DE number 1501070 (Why is no real title available?) | 2000-11-26 | Paper |
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1303582 (Why is no real title available?) | 2000-06-21 | Paper |
A general framework for assembly planning: The motion space approach
Algorithmica | 2000-05-07 | Paper |
| scientific article; zbMATH DE number 1182934 (Why is no real title available?) | 1999-11-08 | Paper |
On the area bisectors of a polygon
Discrete & Computational Geometry | 1999-09-12 | Paper |
| scientific article; zbMATH DE number 1182914 (Why is no real title available?) | 1999-03-02 | Paper |
Spheres, molecules, and hidden surface removal
Computational Geometry | 1998-12-21 | Paper |
A perturbation scheme for spherical arrangements with application to molecular modeling
Computational Geometry | 1998-09-28 | Paper |
Combinatorial complexity of translating a box in polyhedral 3-space
Computational Geometry | 1998-08-30 | Paper |
Reaching a goal with directional uncertainty
Theoretical Computer Science | 1997-02-28 | Paper |
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
Discrete & Computational Geometry | 1996-10-13 | Paper |
Almost tight upper bounds for the single cell and zone problems in the three dimensions
Discrete & Computational Geometry | 1996-06-23 | Paper |
| scientific article; zbMATH DE number 871907 (Why is no real title available?) | 1996-04-28 | Paper |
| scientific article; zbMATH DE number 797447 (Why is no real title available?) | 1996-03-27 | Paper |
Vertical decompositions for triangles in 3-space
Discrete & Computational Geometry | 1996-02-13 | Paper |
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
Discrete & Computational Geometry | 1995-08-27 | Paper |
Vertical decomposition of arrangements of hyperplanes in four dimensions
Discrete & Computational Geometry | 1995-08-13 | Paper |
Arrangements of segments that share endpoints: Single face results
Discrete & Computational Geometry | 1995-07-02 | Paper |
Robot motion planning and the single cell problem in arrangements
Journal of Intelligent & Robotic Systems | 1995-04-20 | Paper |
Efficient ray shooting and hidden surface removal
Algorithmica | 1994-08-10 | Paper |
Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines
Information Processing Letters | 1994-08-03 | Paper |
On the complexity of a single cell in certain arrangements of surfaces related to motion planning
Discrete & Computational Geometry | 1994-07-28 | Paper |
The complexity of the free space for a robot moving amidst fat obstacles
Computational Geometry | 1994-02-17 | Paper |
Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
Computational Geometry | 1992-09-27 | Paper |
Efficient Motion Planning for an L-Shaped Object
SIAM Journal on Computing | 1992-06-28 | Paper |
On disjoint concave chains in arrangements of (pseudo) lines
Information Processing Letters | 1992-06-28 | Paper |
