The following pages link to Mario A. Lopez (Q528550):
Displaying 29 items.
- On the barrier graph of an arrangement of ray sensors (Q528551) (← links)
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- Computing the \(k\)-resilience of a synchronized multi-robot system (Q721922) (← links)
- Failure and communication in a synchronized multi-drone system (Q831750) (← links)
- On finding a widest empty 1-corner corridor (Q844199) (← links)
- Hausdorff approximation of 3D convex polytopes (Q963404) (← links)
- (Q1275655) (redirect page) (← links)
- A special case of Mahler's conjecture (Q1275656) (← links)
- (Q1740355) (redirect page) (← links)
- Permutations in two dimensions that maximally separate neighbors (Q1740356) (← links)
- Linear time approximation of 3D convex polytopes (Q1862132) (← links)
- On the robustness of a synchronized multi-robot system (Q2175045) (← links)
- Locating an obnoxious plane (Q2496077) (← links)
- Hausdorff approximation of convex polygons (Q2573338) (← links)
- Extremal problems on ray sensor configurations (Q2696617) (← links)
- Rectilinear Approximation of a Set of Points in the Plane (Q3525804) (← links)
- On computing connected components of line segments (Q4419685) (← links)
- (Q4643848) (← links)
- FAST PURSUIT OF MOBILE NODES USING TPR TREES (Q4667923) (← links)
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS (Q4762908) (← links)
- Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids (Q4939610) (← links)
- EMBEDDING THE DOUBLE CIRCLE IN A SQUARE GRID OF MINIMUM SIZE (Q5247065) (← links)
- GENERALIZED INTERSECTION SEARCHING PROBLEMS (Q5289294) (← links)
- Weighted Rectilinear Approximation of Points in the Plane (Q5458566) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901271) (← links)
- Connectivity and stochastic robustness of synchronized multi-drone systems (Q6130226) (← links)
- Separability, boxicity, and partial orders (Q6139870) (← links)
- Rainbow ortho-convex 4-sets in k-colored point sets (Q6529869) (← links)
- Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards (Q6661734) (← links)
