Results 101 to 110 of about 4,303,118 (363)
Possibilities of Inner Ear Barrier Models for Otologic Drug Development
This review examines innovative organ chip models that reconstruct critical inner ear barriers, addressing a fundamental challenge in otologic drug development: the limited understanding of pharmaceutical behavior across these complex barriers. By replicating these barriers, the advanced models offer promising alternatives to traditional testing ...
Yeji Ahn +7 more
wiley +1 more source
We prove that every simple polygon contains a degree 3 tree encompassing a prescribed set of vertices. We give tight bounds on the minimal number of degree 3 vertices. We apply this result to reprove a result from Bose et al. that every set of disjoint line segments in the plane admits a binary tree.
openaire +2 more sources
Moduli space of simple polygons
In this work we study the space S(n) of positively oriented, simple n-gons with labeled vertices up to oriented similarity and M(n) the moduli space of simple n-gons as a quotient of S(n). We give a local description of S(n) and M(n) around the regular n-gon and describe completely the two spaces when n = 4 using a topological Morse function.
González, Ahtziri +1 more
openaire +2 more sources
ggalign: Bridging the Grammar of Graphics and Biological Multilayered Complexity
The ggalign package provides a comprehensive framework for composable visualization built on top of ggplot2. Its primary purpose is to enable the construction of complex multi‐plot layouts with consistent observation alignment across plots, particularly for high‐dimensional data contexts such as genomics, transcriptomics, and microbiome studies ...
Yun Peng +9 more
wiley +1 more source
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular
Keivan Borna
doaj
Constant-work-space algorithms for geometric problems
Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as a read-only array.
Tetsuo Asano +3 more
doaj +1 more source
Elevated levels of the plasticizer DEHP associate with earlier breast cancer diagnosis. DEHP enhances glutamine‐powered energy production via the transporter SLC6A14 and pushes mitochondria toward fusion, driving tumor initiation by boosting cancer stemness. Blocking SLC6A14 lowers stemness, slows tumors, and improves chemotherapy response.
Dai‐Wei Hu +15 more
wiley +1 more source
Computing medial axis of a simple polygon in linear time based on R-L sequence
Medial axis computation has wide applications in pattern recognition, image processing, finite element mesh generation, and CNC tool path extraction. Aiming to explore intrinsic geometric attributes of the medial axis of a simple polygon which can be ...
Hongyu Chen, Xiaodiao Chen, Yizhao Xue
doaj +1 more source
Cellpose+, a Morphological Analysis Tool for Feature Extraction of Stained Cell Images
We introduce Cellpose plus, a morphological and geometrical analysis tool for feature extraction of stained cell images built over Cellpose, a state‐of‐the‐art cell segmentation framework. We also introduce a dataset of DAPI and FITC stained cells to which our new method is applied.
Israel A. Huaman +10 more
wiley +1 more source
Geographic features in maps consist of a mixture of points, polylines, and polygons, generally including POIs, roads, buildings, and other geographic features.
Chongya Gong +4 more
doaj +1 more source

