Results 141 to 150 of about 142,034 (198)
Some of the next articles are maybe not open access.
Disk potential functions for polygon spaces
The Journal of Symplectic Geometry, 2022We derive a Floer theoretical SYZ mirror for an equilateral and generic polygon space. The disk potential function of the monotone torus fiber of the caterpillar bending system is calculated by computing non-trivial open Gromov--Witten invariants from ...
Yoosik Kim, Siu-Cheong Lau, Xiao Zheng
semanticscholar +1 more source
Polygon Overlay Analysis Algorithm Based on Monotone Chain and STR Tree in the Simple Feature Model
International Conference on Electrical and Control Engineering, 2010 Zhanlong Chen, Lina Ma, Liang Wu
openalex +2 more sources
Saturation Results Around the Erdős-Szekeres Problem
International Symposium on Computational Geometry, 2023In this paper, we consider saturation problems related to the celebrated Erd\H{o}s--Szekeres convex polygon problem. For each $n \ge 7$, we construct a planar point set of size $(7/8) \cdot 2^{n-2}$ which is saturated for convex $n$-gons.
G'abor Dam'asdi +3 more
semanticscholar +1 more source
Note on covering monotone orthogonal polygons with star-shaped polygons
Information Processing Letters, 2007In 1986, Keil provided an O(n2) time algorithm for the problem of covering monotone orthogonal polygons with the minimum number of r-star-shaped orthogonal polygons. This was later improved to O(n) time and space by Gewali et al. in [L. Gewali, M. Keil, S.C.
Paweł Żyliński +2 more
openaire +2 more sources
Euler Polygonal Lines for Itô Equations with Monotone Coefficients
Theory of Probability & Its Applications, 1988 L. A. Alyushina
openalex +3 more sources
On decomposing polygons into uniformly monotone parts
Information Processing Letters, 1988Abstract In this paper we present an O( n 3 ) algorithm for finding a maximum set of independent chords in a circle with n vertices on its circumference. We use this result to partition simple polygons into the minimum number of uniformly monotone polygons.
Robin Liu, Simeon Ntafos
openaire +2 more sources
, 2019
The paper is concerned with the analysis of the discontinuous Galerkin method (DGM) for the numerical solution of an elliptic boundary value problem with a nonlinear Newton boundary condition in a two-dimensional polygonal domain.
M. Feistauer, Filip Roskovec, A. Sändig
semanticscholar +1 more source
The paper is concerned with the analysis of the discontinuous Galerkin method (DGM) for the numerical solution of an elliptic boundary value problem with a nonlinear Newton boundary condition in a two-dimensional polygonal domain.
M. Feistauer, Filip Roskovec, A. Sändig
semanticscholar +1 more source
Feature Selection Based on Orthogonal Constraints and Polygon Area
arXiv.orgThe goal of feature selection is to choose the optimal subset of features for a recognition task by evaluating the importance of each feature, thereby achieving effective dimensionality reduction.
Zhenxing Zhang +4 more
semanticscholar +1 more source
A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
arXiv.orgWe present parametric breadth-first search (PBFS), a new algorithm for solving the parametric minimum cut problem in a network with source-sink-monotone capacities.
Arne Beines +4 more
semanticscholar +1 more source
The Zarankiewicz Problem for Polygon Visibility Graphs
arXiv.orgWe prove a quasi-linear upper bound on the size of $K_{t,t}$-free polygon visibility graphs. For visibility graphs of star-shaped and monotone polygons we show a linear bound.
Eyal Ackerman, Balázs Keszegh
semanticscholar +1 more source