Results 21 to 30 of about 142,034 (198)
The VC-dimension of visibility on the boundary of monotone polygons
Computational Geometry, 2018 Abstract We show that the VC-dimension of visibility on the boundary of a monotone polygon is exactly 6. Our lower bound construction matches the best known lower bound for simple polygons.
Matt Gibson, Erik Krohn, Qing Wang
openalex +3 more sources
Modem illumination of monotone polygons
, 2009 We study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of walls. We call these objects k-modems and study the minimum number of k-modems necessary to illuminate monotone and monotone orthogonal polygons.
Oswin Aichholzer +6 more
openalex +2 more sources
Approximating monotone polygonal curves using the uniform metric [PDF]
Proceedings of the twelfth annual symposium on Computational geometry - SCG '96, 1996 Kasturi Varadarajan
openalex +3 more sources
Visibility-monotonic polygon deflation [PDF]
Contributions to Discrete Mathematics, 2012 A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. (2012) by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show that the least n for which there exists such an n-gon is seven.
Pat Morin +3 more
openaire +2 more sources
Minimum Star Partitions of Simple Polygons in Polynomial Time [PDF]
Symposium on the Theory of Computing, 2023 We devise a polynomial-time algorithm for partitioning a simple polygon P into a minimum number of star-shaped polygons. The question of whether such an algorithm exists has been open for more than four decades [Avis and Toussaint, Pattern Recognit ...
Mikkel Abrahamsen +3 more
semanticscholar +1 more source
Q-Curve and Area Rules for Choosing Heuristic Parameter in Tikhonov Regularization
Mathematics, 2020 We consider choice of the regularization parameter in Tikhonov method if the noise level of the data is unknown. One of the best rules for the heuristic parameter choice is the quasi-optimality criterion where the parameter is chosen as the global ...
Toomas Raus, Uno Hämarik
doaj +1 more source
A priori filtration of points for finding convex hull
Technological and Economic Development of Economy, 2006 Convex hull is the minimum area convex polygon containing the planar set. By now there are quite many convex hull algorithms (Graham Scan, Jarvis March, QuickHull, Incremental, Divide‐and‐Conquer, Marriage‐before‐Conquest, Monotone Chain, Brute Force ...
Laura Vyšniauskaitė +1 more
doaj +1 more source
Testing a simple polygon for monotonicity optimally in parallel
[1993] Proceedings Seventh International Parallel Processing Symposium, 1993 Abstract We show that, in parallel, an n -vertex simple polygon can be tested for monotonicity optimally in O(log n ) time using O( n /log n ) EREW PRAM processors, and we present two different optimal parallel algorithms for solving this problem.
Chen, Danny Z., Guha, Sumanta
openaire +5 more sources
Coverage path planning considering the cell number and starting position
Xi'an Gongcheng Daxue xuebaoThe coverage tasks of mobile robots are evolving towards large-scale and intelligent directions, demanding urgent requirements for the coverage efficiency and environmental adaptability of coverage path planning. To address the inadequate adaptability of
MA Mingyan +4 more
doaj +1 more source
Poka: A Necro‐Robot Beetle with a Measured Payload Ratio of 6847%
Advanced Robotics Research, EarlyView.Here, Poka, a necro‐robot beetle with the ability to carry more than 68 times its own weight, is introduced, making it also a walking robot with the highest payload ratio measured to date. This paper is concerned with the design, manufacture and validation of ‘Poka', a novel millimetre‐scale necro‐robot aimed at bridging the performance gap between ...
Yordan Tsvetkov, Parvez Alam
wiley +1 more source