Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Miyata, Hiroyuki"'
Autor:
Miyata, Hiroyuki
The angular resolution of a planar straight-line drawing of a graph is the smallest angle formed by two edges incident to the same vertex. Garg and Tamassia (ESA '94) constructed a family of planar graphs with maximum degree $d$ that have angular res
Externí odkaz:
http://arxiv.org/abs/2309.08401
Autor:
Miyata, Hiroyuki, Nosaka, Reiya
A (Euclidean) greedy drawing of a graph is a drawing in which, for any two vertices $s,t$ ($s \neq t$), there is a neighbor vertex of $s$ that is closer to $t$ than to $s$ in the Euclidean distance. Greedy drawings are important in the context of mes
Externí odkaz:
http://arxiv.org/abs/2203.04664
Autor:
Miyata, Hiroyuki
Publikováno v:
European Journal of Combinatorics, 86 (2020) 103065
The Folkman-Lawrence topological representation theorem, which states that every (loop-free) oriented matroid of rank $r$ can be represented as a pseudosphere arrangement on the $(r-1)$-dimensional sphere $S^{r-1}$, is one of the most outstanding res
Externí odkaz:
http://arxiv.org/abs/1809.04236
Publikováno v:
In The Journal of Thoracic and Cardiovascular Surgery September 2022 164(3):785-794
Autor:
Miyata, Hiroyuki
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact, Goodman and
Externí odkaz:
http://arxiv.org/abs/1703.04963
Autor:
Miyata, Hiroyuki, Padrol, Arnau
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been widely studied
Externí odkaz:
http://arxiv.org/abs/1408.0688
Autor:
Klaus, Lorenz, Miyata, Hiroyuki
The linear complementarity problem (LCP) provides a unified approach to many problems such as linear programs, convex quadratic programs, and bimatrix games. The general LCP is known to be NP-hard, but there are some promising results that suggest th
Externí odkaz:
http://arxiv.org/abs/1309.7225
Autor:
Miyata, Hiroyuki
Symmetries of geometric structures such as hyperplane arrangements, point configurations and polytopes have been studied extensively for a long time. However, symmetries of oriented matroids, a common combinatorial abstraction of them, are not unders
Externí odkaz:
http://arxiv.org/abs/1301.6451
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and Fukuda (20
Externí odkaz:
http://arxiv.org/abs/1204.0645