6 citations · 18 across the 8 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2005
Every non-Euclidean oriented matroid admits a biquadratic final polynomial
Komei Fukuda, Sonoko Moriyama, Hiroki Nakayama
Richter-Gebert proved that every non-Euclidean uniform oriented matroid admits a biquadratic final polynomial. We extend this result to the non-uniform case.
math.CO2000★ 3 cited
The Complexity of Finding Small Triangulations of Convex 3-Polytopes
Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.