Dimitris Pagonakis - Academia.edu (original) (raw)

Uploads

Papers by Dimitris Pagonakis

Research paper thumbnail of Load-path optimisation of funicular networks

Research paper thumbnail of Lower Bound for Convex Hull Area and Universal Cover Problems

International Journal of Computational Geometry & Applications, 2013

We provide a technique to obtain a lower bound for the area of the convex hull of a set of points... more We provide a technique to obtain a lower bound for the area of the convex hull of a set of points and a rectangle in the plane, and then apply the resulting estimates to improve the lower bound for the convex case of Moser's Worm problem. Specifically, we show that any convex universal cover for unit arcs has an area of at least 0.232239. We also apply our approach to the universal cover problem for closed unit curves.

Research paper thumbnail of MIT International Students Network: Gathering Real World Data to Predict Admission Statistics

Research paper thumbnail of LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS

We provide a technique to obtain a lower bound for the area of the convex hull of a set of points... more We provide a technique to obtain a lower bound for the area of the convex hull of a set of points and a rectangle in the plane, and then apply the resulting estimates to improve the lower bound for the convex case of Moser's Worm problem. Specifically, we show that any convex universal cover for unit arcs has an area of at least 0.232239. We also apply our approach to the universal cover problem for closed unit curves.

Research paper thumbnail of Load-path optimisation of funicular networks

Research paper thumbnail of Lower Bound for Convex Hull Area and Universal Cover Problems

International Journal of Computational Geometry & Applications, 2013

We provide a technique to obtain a lower bound for the area of the convex hull of a set of points... more We provide a technique to obtain a lower bound for the area of the convex hull of a set of points and a rectangle in the plane, and then apply the resulting estimates to improve the lower bound for the convex case of Moser's Worm problem. Specifically, we show that any convex universal cover for unit arcs has an area of at least 0.232239. We also apply our approach to the universal cover problem for closed unit curves.

Research paper thumbnail of MIT International Students Network: Gathering Real World Data to Predict Admission Statistics

Research paper thumbnail of LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS

We provide a technique to obtain a lower bound for the area of the convex hull of a set of points... more We provide a technique to obtain a lower bound for the area of the convex hull of a set of points and a rectangle in the plane, and then apply the resulting estimates to improve the lower bound for the convex case of Moser's Worm problem. Specifically, we show that any convex universal cover for unit arcs has an area of at least 0.232239. We also apply our approach to the universal cover problem for closed unit curves.

Log In