Abstract: Finding the convex hull of a set of points in a plane is one of the most common problems in computational geometry. We survey known algorithms for solving this problem and look into methods ...

Creative Commons (CC): This is a Creative Commons license. Attribution (BY): Credit must be given to the creator. We adapted an existing approach to identifying stabilizable crystal structures from ...

A new approach to the local and global explanation based on selecting a convex hull constructed for the finite number of points around an explained instance is proposed. The convex hull allows us to ...

Before the year 2000, people in Hull and East Yorkshire really didn’t need a timetable to work out how to get to London. The daily train left Hull at 0700 and returned from King’s Cross at 1720. The ...

The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.

Gift Wrap and Incremental Algorithm for the calculation of convex hull. Also, algorithm that finds the lattice points of a circle.

This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses ...

Abstract: Filmification of methods is a promising concept to find new formats for program and data/knowledge representation. It is also to create a basis for specifying and developing a new generation ...