We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subdivide a bounding box into simply connected faces. Our data structures have O((n + m) log n) size for n sites and m barriers. They support O(m) barrier insertions and O(n) site deletions in O((m + n) polylog (mn)) total time, an...

based on a complete heyting algebra, we modify the definition oflattice-valued fuzzifying convergence space using fuzzy inclusionorder and construct in this way a cartesian-closed category, calledthe category of $l-$ordered fuzzifying convergence spaces, in whichthe category of $l-$fuzzifying topological spaces can be embedded.in addition, two new categories are introduced, which are called the...

based on a complete heyting algebra l, the relations between lfuzzifyingconvergence spaces and l-fuzzifying topological spaces are studied.it is shown that, as a reflective subcategory, the category of l-fuzzifying topologicalspaces could be embedded in the category of l-fuzzifying convergencespaces and the latter is cartesian closed. also the specialization l-preorderof l-fuzzifying convergenc...

By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions defined over the real space. In this paper, we consider a ...