In this paper, we discuss measures for polygons that may be computed efficiently, and in which closeness implies similarity with respect to deviation from ...
Known measurements on planar figures that may be computed efficiently include the Hausdorff metric and the homotopy type. However, these allow two objects ...
Orientable convexity, geodetic and hull numbers in graphs. We prove three results conjectured or stated by Chartrand and Zhang [European J. · Computing ...
Sep 13, 2023 · We consider the width of a convex n-gon T in the plane along the random direction and study its deviation rate.
Missing: Computing convexity
Sep 22, 2014 · Before testing for convexity, you need to test for whether the resulting path is simple (ie no edge intersects any other edge). If so, then the ...
Convex decomposition has application in many areas including pattern recognition [17], Minkoski sum computation [1], motion planning. [22], computer graphics [ ...
A new area-based convexity measure for polygons is de- scribed. It has the desirable properties that it is not sensitive to small boundary defects, ...
We consider the width X T ( ω ) of a convex n-gon T in the plane along the random direction ω ∈ R / 2 π Z and study its deviation rate:.
Jun 16, 2020 · Try to assess similarity by computing ratio of area a smaller polygon to area of convex hull of both polygons.
Missing: deviations | Show results with:deviations
Abstract. A polygon C is an intersecting polygon for a set O of objects in R2 if C intersects each object in O, where the polygon includes its interior.