| Publication | Date of Publication | Type |
|---|
An optimal algorithm for finding the separation of simple polygons
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Provably optimal parallel transport sweeps on semi-structured grids
Journal of Computational Physics | 2022-04-07 | Paper |
Distributed reconfiguration of metamorphic robot chains
Distributed Computing | 2020-12-04 | Paper |
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Approximate convex decomposition of polygons
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Distributed reconfiguration of metamorphic robot chains
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Planning with reachable distances
Springer Tracts in Advanced Robotics | 2011-03-02 | Paper |
RESAMPL: A Region-Sensitive Adaptive Motion Planner
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
Incremental Map Generation (IMG)
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
A motion planning approach to studying molecular motions
Communications in Information and Systems | 2010-04-23 | Paper |
Approximate convex decomposition of polyhedra and its applications
Computer Aided Geometric Design | 2009-10-22 | Paper |
| A path planning-based study of protein folding with a case study of hairpin formation in protein G and L | 2008-04-14 | Paper |
Simulating Protein Motions with Rigidity Analysis
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Approximate convex decomposition of polygons
Computational Geometry | 2006-10-10 | Paper |
| A kinematics-based probabilistic roadmap method for closed chain systems | 2003-08-05 | Paper |
| scientific article; zbMATH DE number 1940299 (Why is no real title available?) | 2003-06-26 | Paper |
scientific article; zbMATH DE number 1869463 (Why is no real title available?)
Autonomous Robots | 2003-02-17 | Paper |
A randomized algorithm for triangulating a simple polygon in linear time
Discrete & Computational Geometry | 2002-09-11 | Paper |
| scientific article; zbMATH DE number 1263244 (Why is no real title available?) | 2001-08-28 | Paper |
| scientific article; zbMATH DE number 1445368 (Why is no real title available?) | 2000-05-10 | Paper |
A time-optimal parallel algorithm for three-dimensional convex hulls
Algorithmica | 1996-03-11 | Paper |
Finding a closet visible vertex pair between two polygons
Algorithmica | 1995-10-09 | Paper |
An alternative method to solve the hadronic cosmic-ray diffusion equations: the muon and neutrino fluxes
Journal of Physics A: Mathematical and General | 1995-06-19 | Paper |
DETERMINING THE SEPARATION OF SIMPLE POLYGONS
International Journal of Computational Geometry & Applications | 1995-04-06 | Paper |
Improved processor bounds for parallel algorithms for weighted directed graphs
Information Processing Letters | 1993-05-16 | Paper |
THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
Reversing trains: A turn of the century sorting problem
Journal of Algorithms | 1989-01-01 | Paper |
