Zobrazeno 1 - 10
of 408
pro vyhledávání: '"Langerman, Stefan"'
Autor:
Demaine, Erik D., Langerman, Stefan
We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding reflections)? This res
Externí odkaz:
http://arxiv.org/abs/2409.11582
We present an algorithm that enumerates and classifies all edge-to-edge gluings of unit squares that correspond to convex polyhedra. We show that the number of such gluings of $n$ squares is polynomial in $n$, and the algorithm runs in time polynomia
Externí odkaz:
http://arxiv.org/abs/2104.06787
The fragile complexity of a comparison-based algorithm is $f(n)$ if each input element participates in $O(f(n))$ comparisons. In this paper, we explore the fragile complexity of algorithms adaptive to various restrictions on the input, i.e., algorith
Externí odkaz:
http://arxiv.org/abs/2102.00338
We give a complete description of all convex polyhedra whose surface can be constructed from several congruent regular pentagons by folding and gluing them edge to edge. Our method of determining the graph structure of the polyhedra from a gluing is
Externí odkaz:
http://arxiv.org/abs/2007.01753
A data structure is presented that explicitly maintains the graph of a Voronoi diagram of $N$ point sites in the plane or the dual graph of a convex hull of points in three dimensions while allowing insertions of new sites/points. Our structure suppo
Externí odkaz:
http://arxiv.org/abs/2007.01686
Autor:
Arseneva, Elena, Langerman, Stefan
Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including all simpl
Externí odkaz:
http://arxiv.org/abs/2002.02052
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We consider the design of adaptive data structures for searching elements of a tree-structured space. We use a natural generalization of the rotation-based online binary search tree model in which the underlying search space is the set of vertices of
Externí odkaz:
http://arxiv.org/abs/1908.00848
We revisit self-adjusting external memory tree data structures, which combine the optimal (and practical) worst-case I/O performances of B-trees, while adapting to the online distribution of queries. Our approach is analogous to undergoing efforts in
Externí odkaz:
http://arxiv.org/abs/1903.03560
We consider the following problem: given three sets of real numbers, output a word-RAM data structure from which we can efficiently recover the sign of the sum of any triple of numbers, one in each set. This is similar to a previous work by some of t
Externí odkaz:
http://arxiv.org/abs/1903.02645