The most inaccessible point of a convex domain
From MaRDI portal
Publication:2871640
zbMATH Open1282.51005arXiv1009.2948MaRDI QIDQ2871640
Author name not available (Why is that?)
Publication date: 9 January 2014
Published in: (Search for Journal in Brave)
Abstract: The inaccessibility of a point p in a bounded domain D subset R^n is the minimum of the lengths of segments through p with boundary at �d D. The points of maximum inaccessibility I_D are those where the inaccessibility achieves its maximum. We prove that for strictly convex domains, I_D is either a point or a segment, and that for a planar polygon I_D is in general a point. We study the case of a triangle, showing that this point is not any of the classical notable points.
Full work available at URL: https://arxiv.org/abs/1009.2948
No records found.
No records found.
This page was built for publication: The most inaccessible point of a convex domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2871640)
