Search Results - "Kliem, Jonathan"

  • Showing 1 - 7 results of 7
Refine Results
  1. 1

    A New Face Iterator for Polyhedra and for More General Finite Locally Branched Lattices by Kliem, Jonathan, Stump, Christian

    Published in Discrete & computational geometry (01-06-2022)
    “…We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally branched lattice. This…”
    Get full text
    Journal Article
  2. 2

    Applications of Topology, Combinatorics and Algorithms to Discrete Geometry by Kliem, Jonathan

    Published 01-01-2022
    “…In Chapter 1, we show upper bounds to the Grünbaum–Hadwiger–Ramos problem. We give new proofs for almost all known upper bounds and improve the following…”
    Get full text
    Dissertation
  3. 3

    More Bisections by Hyperplane Arrangements by Blagojević, Pavle V. M., Blagojević, Aleksandra Dimitrijević, Karasev, Roman, Kliem, Jonathan

    Published in Discrete & computational geometry (2022)
    “…A union of an arrangement of affine hyperplanes H in R d is the real algebraic variety associated to the principal ideal generated by the polynomial p H given…”
    Get full text
    Journal Article
  4. 4

    A new $k$-partite graph $k$-clique iterator and the optimal colored Tverberg problem for ten colored points by Kliem, Jonathan

    Published 08-12-2021
    “…We provide an algorithm that verifies the optimal colored Tverberg problem for $10$ points in the plane: Every $10$ points in the plane in color classes of…”
    Get full text
    Journal Article
  5. 5

    Counting Gray codes for an improved upper bound of the Gr\"unbaum-Hadwiger-Ramos problem by Kliem, Jonathan

    Published 14-10-2021
    “…We give an improved upper bound for the Gr\"unbaum--Hadwiger--Ramos problem: Let $d,n,k \in \mathbb{N}$ such that $d \geq 2^n(1+2^{k-1})$. Given $2^{n+1}$…”
    Get full text
    Journal Article
  6. 6

    A new face iterator for polyhedra and more general finite locally branched lattices by Kliem, Jonathan, Stump, Christian

    Published 17-01-2020
    “…Discrete Comput Geom (2022) We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally…”
    Get full text
    Journal Article
  7. 7

    More bisections by hyperplane arrangements by Blagojević, Pavle V. M, Blagojević, Aleksandra Dimitrijević, Karasev, Roman, Kliem, Jonathan

    Published 21-05-2021
    “…Discrete and Computational Geometry 67 (2022), 33--64 A union of an arrangement of affine hyperplanes $H$ in $R^d$ is the real algebraic variety associated to…”
    Get full text
    Journal Article