Results 181 to 190 of about 5,737 (222)
Some of the next articles are maybe not open access.
Monotonic Polygons and Paths in Weighted Point Sets
2011Let P be a set of n points such that each of its elements has a unique weight in {1, …,n}. P is called a wp-set. A non-crossing polygonal line connecting some elements of P in increasing (or decreasing) order of their weights is called a monotonic path of P. A simple polygon with vertices in P is called monotonic if it is formed by a monotonic path and
Toshinori Sakai, Jorge Urrutia
openaire +1 more source
Testing a simple polygon for monotonicity
Information Processing Letters, 1981Franco P. Preparata, Kenneth J. Supowit
openaire +1 more source
CPP-Net: Context-Aware Polygon Proposal Network for Nucleus Segmentation
IEEE Transactions on Image Processing, 2023Shengcong Chen +2 more
exaly
Wide-field polygon-scanning photoacoustic microscopy of oxygen saturation at 1-MHz A-line rate
Photoacoustics, 2020Jiangbo Chen, Yachao Zhang, Linyun He
exaly
, 2007 Covalent organic frameworks: a materials platform for structural and functional designs
Nature Reviews Materials, 2016Ningjian Huang, Donglin Jiang
exaly