University of Leicester
Browse

Box-Search Algorithm (BSA) in Chapter 5 (Matlab codes)

Download all (3.88 kB)
software
posted on 2020-11-28, 22:59 authored by Sittichoke Som-AmSittichoke Som-Am
In Chapter 5, we use this method to prove the lower bound of convex cover for closed unit arcs is 0.1. There are two files:

cvhN2 is a function to find the area of convex hull of a circle, a rectangle, and a line.

checkminNB5 is a function to prove the bound by Box-search Algorithm.

History

Usage metrics

    Department of Mathematics

    Categories

    Keywords

    convex optimizationConvex HullMatlab codesGeometryOptimisation

    Licence

    CC BY 4.0

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC