The following pages link to Nancy M. Amato (Q735497):
Displayed 29 items.
- (Q209552) (redirect page) (← links)
- Approximate convex decomposition of polyhedra and its applications (Q735498) (← links)
- A motion planning approach to studying molecular motions (Q966198) (← links)
- (Q1209342) (redirect page) (← links)
- Improved processor bounds for parallel algorithms for weighted directed graphs (Q1209343) (← links)
- A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Provably optimal parallel transport sweeps on semi-structured grids (Q2122727) (← links)
- Approximate convex decomposition of polygons (Q2507162) (← links)
- (Q2749790) (← links)
- Planning with Reachable Distances (Q3079501) (← links)
- Incremental Map Generation (IMG) (Q3564294) (← links)
- RESAMPL: A Region-Sensitive Adaptive Motion Planner (Q3564313) (← links)
- Simulating Protein Motions with Rigidity Analysis (Q3596255) (← links)
- THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED (Q4017521) (← links)
- (Q4234117) (← links)
- DETERMINING THE SEPARATION OF SIMPLE POLYGONS (Q4327390) (← links)
- (Q4406680) (← links)
- Reversing trains: A turn of the century sorting problem (Q4729371) (← links)
- (Q4794217) (← links)
- An alternative method to solve the hadronic cosmic-ray diffusion equations: the muon and neutrino fluxes (Q4836577) (← links)
- (Q4952690) (← links)
- An optimal algorithm for finding the separation of simple polygons (Q5060097) (← links)
- Distributed reconfiguration of metamorphic robot chains (Q5138512) (← links)
- Distributed reconfiguration of metamorphic robot chains (Q5176782) (← links)
- Linear-time triangulation of a simple polygon made easier via randomization (Q5361531) (← links)
- Approximate convex decomposition of polygons (Q5361650) (← links)
- (Q5456763) (← links)
- A randomized algorithm for triangulating a simple polygon in linear time (Q5946382) (← links)