Abstract: Distribution network optimization is represented by non-convex power flow equations, where traditional convex relaxation methods may lead to inaccurate or infeasible solutions. To ...
When computing the intersection of two non-overlapping simple polygons, boost::geometry::intersection incorrectly returns a non-empty result, containing the full area of one polygon. This is a ...
Abstract: In this article, we present an efficient unified algorithm for the minimum Euclidean distance between two collections of compact convex sets, each of which can be a collection of convex ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback