اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn Efficient Algorithm to Calculate the Center of the Biggest Inscribed Circle in an Irregular Polygon
148
0
0.0
(
0
)
تأليف
Oscar Martinez
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, an efficient algorithm to find the center of the biggest circle inscribed in a given polygon is described. This work was inspired by the publication of Daniel Garcia-Castellanos & Umberto Lombardo and their algorithm used to find a landmass poles of inaccessibility. Two more efficient algorithms were found, one of them only applicable when the problem can be described as a linear problem, like in the case of a convex polygon. Keywords: distance geometry, euclidean distance, inscribed circle, irregular polygon, algorithm, mathematical optimization, Monte Carlo, linear programming, maximin
قيم البحث
اقرأ أيضاً
We consider the problem of sampling from a density of the form $p(x) propto exp(-f(x)- g(x))$, where $f: mathbb{R}^d rightarrow mathbb{R}$ is a smooth and strongly convex function and $g: mathbb{R}^d rightarrow mathbb{R}$ is a convex and Lipschitz fu
nction. We propose a new algorithm based on the Metropolis-Hastings framework, and prove that it mixes to within TV distance $varepsilon$ of the target density in at most $O(d log (d/varepsilon))$ iterations. This guarantee extends previous results on sampling from distributions with smooth log densities ($g = 0$) to the more general composite non-smooth case, with the same mixing time up to a multiple of the condition number. Our method is based on a novel proximal-based proposal distribution that can be efficiently computed for a large class of non-smooth functions $g$.
Consider a random set of points on the unit sphere in $mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the case $d=3$,
for which there are elementary proofs and fascinating formulas for metric properties. In particular, we study the fraction of acute facets, the expected intrinsic volumes, the total edge length, and the distance to a fixed point. Finally we generalize the results to the ellipsoid with homeoid density.
Finding reliably and efficiently the spectrum of the resonant states of an optical system under varying parameters of the medium surrounding it is a technologically important task, primarily due to various sensing applications. Computationally, it pr
esents, however, a fundamental challenge owing to the nature of the eigenstates of an open system lacking completeness outside it. We solve this challenge by making a linear transformation of Maxwells equations which maps perturbations of the surrounding medium onto effective perturbations within the system where the resonant states are complete. By treating such perturbations with the rigorous resonant state expansion, we find the modified modes of the system for arbitrary perturbations of the medium with any required accuracy. Numerically efficient single and few mode approximations are shown to be precise in practically important cases of, respectively, plasmonic nanoparticles and dielectric micro resonators.
The availability of a robust and efficient routine for calculating light curves of a finite source magnified due to bending its light by the gravitational field of an intervening binary lens is essential for determining the characteristics of planets
in such microlensing events, as well as for modelling stellar lens binaries and resolving the brightness profile of the source star. However, the presence of extended caustics and the fact that the images of the source star cannot be determined analytically while their number depends on the source position (relative to the lens system), makes such a task difficult in general. Combining the advantages of several earlier approaches, an adaptive contouring algorithm is presented, which only relies on a small number of simple rules and operations on the adaptive search grid. By using the parametric representation of critical curves and caustics found by Erdl & Schneider (1993), seed solutions to the adaptive grid are found, which ensures that no images or holes are missed.
Let $C$ be the unit circle in $mathbb{R}^2$. We can view $C$ as a plane graph whose vertices are all the points on $C$, and the distance between any two points on $C$ is the length of the smaller arc between them. We consider a graph augmentation pro
blem on $C$, where we want to place $kgeq 1$ emph{shortcuts} on $C$ such that the diameter of the resulting graph is minimized. We analyze for each $k$ with $1leq kleq 7$ what the optimal set of shortcuts is. Interestingly, the minimum diameter one can obtain is not a strictly decreasing function of~$k$. For example, with seven shortcuts one cannot obtain a smaller diameter than with six shortcuts. Finally, we prove that the optimal diameter is $2 + Theta(1/k^{frac{2}{3}})$ for any~$k$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
