1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.CG2023
A new upper bound for angular resolution
Hiroyuki Miyata
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…
math.CO2014★ 1 cited
Enumerating neighborly polytopes and oriented matroids
Hiroyuki Miyata, Arnau Padrol
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…
math.CO2012★ 1 cited
Complete enumeration of small realizable oriented matroids
Komei Fukuda, Hiroyuki Miyata, Sonoko Moriyama
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…