当前期刊: Discrete & Computational Geometry Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
  • Tilings of Convex Polyhedral Cones and Topological Properties of Self-Affine Tiles
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-10-16
    Ya-min Yang, Yuan Zhang

    Let \({\varvec{a}}_1,\ldots , {\varvec{a}}_r\) be vectors in a half-space of \({\mathbb {R}}^n\). We call \(C={\varvec{a}}_1{\mathbb {R}}^{+}+\cdots +{\varvec{a}}_r {\mathbb {R}}^{+}\) a convex polyhedral cone and \(\{{\varvec{a}}_1,\ldots , {\varvec{a}}_r\}\) a generator set of C. A generator set with the minimal cardinality is called a frame. We investigate the translation tilings of convex polyhedral

  • Counterexample to a Variant of a Conjecture of Ziegler Concerning a Simple Polytope and Its Dual
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-10-15
    William Gustafson

    Problem 4.19 in Ziegler (Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)) asserts that every simple 3-dimensional polytope has the property that its dual can be constructed as the convex hull of points chosen from the facets of the original polytope. In this note we state a variant of this conjecture that requires the points to be a subset of the vertices of

  • Counting Polygon Triangulations is Hard
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-10-13
    David Eppstein

    We prove that it is \(\#{\mathsf {P}}\)-complete to count the triangulations of a (non-simple) polygon.

  • Classification of Triples of Lattice Polytopes with a Given Mixed Volume
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-10-13
    Gennadiy Averkov, Christopher Borger, Ivan Soprunov

    We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume m in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number of which is finite for fixed m. Following this algorithm, we enumerate all irreducible triples of normalized mixed volume up to 4 that are inclusion-maximal. This

  • Randomized Construction of Complexes with Large Diameter
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-09-23
    Francisco Criado, Andrew Newman

    We consider the question of the largest possible combinatorial diameter among pure dimensional and strongly connected \((d-1)\)-dimensional simplicial complexes on n vertices, denoted \(H_s(n, d)\). Using a probabilistic construction we give a new lower bound on \(H_s(n, d)\) that is within an \(O(d^2)\) factor of the upper bound. This improves on the previously best known lower bound which was within

  • Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-09-22
    Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir

    We describe a new data structure for dynamic nearest neighbor queries in the plane with respect to a general family of distance functions. These include \(L_p\)-norms and additively weighted Euclidean distances. Our data structure supports general (convex, pairwise disjoint) sites that have constant description complexity (e.g., points, line segments, disks, etc.). Our structure uses \(O(n \log ^3

  • Packing Disks by Flipping and Flowing
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-09-14
    Robert Connelly, Steven J. Gortler

    We provide a new type of proof for the Koebe–Andreev–Thurston (KAT) planar circle packing theorem based on combinatorial edge-flips. In particular, we show that starting from a disk packing with a maximal planar contact graph G, one can remove any flippable edge \(e^-\) of this graph and then continuously flow the disks in the plane, so that at the end of the flow, one obtains a new disk packing whose

  • Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-09-08
    Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse

    Randomized incremental construction (RIC) is one of the most important paradigms for building geometric data structures. Clarkson and Shor developed a general theory that led to numerous algorithms which are both simple and efficient in theory and in practice. Randomized incremental constructions are usually space-optimal and time-optimal in the worst case, as exemplified by the construction of convex

  • Tverberg-Type Theorems with Altered Intersection Patterns (Nerves)
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-09-08
    Jesús A. De Loera, Thomas A. Hogan, Deborah Oliveros, Dominic Yang

    Tverberg’s theorem says that a set with sufficiently many points in \({\mathbb {R}}^d\) can always be partitioned into m parts so that the \((m-1)\)-simplex is the (nerve) intersection pattern of the convex hulls of the parts. The main results of our paper demonstrate that Tverberg’s theorem is just a special case of a more general situation, where other simplicial complexes must always arise as nerve

  • Smallest k -Enclosing Rectangle Revisited
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-09-02
    Timothy M. Chan, Sariel Har-Peled

    Given a set of n points in the plane, and a parameter \(k\), we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing \(k\) points. We present the first near quadratic time algorithm for this problem, improving over the previous near-\(O(n^{5/2})\)-time algorithm by Kaplan et al. (25th European Symposium on Algorithms. Leibniz Int Proc Inform, vol. 87, # 52

  • Random Geometric Complexes and Graphs on Riemannian Manifolds in the Thermodynamic Limit
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-08-31
    Antonio Lerario, Raffaella Mulas

    We investigate some topological properties of random geometric complexes and random geometric graphs on Riemannian manifolds in the thermodynamic limit. In particular, for random geometric complexes we prove that the normalized counting measure of connected components, counted according to isotopy type, converges in probability to a deterministic measure. More generally, we also prove similar convergence

  • On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-08-31
    Arseniy V. Akopyan, Alexander I. Bobenko, Wolfgang K. Schief, Jan Techter

    Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with classical deformations of quadrics that are isometric along asymptotic lines and circular cross-sections of quadrics are revealed. The existence of octahedral webs

  • The Combinatorial Geometry of Stresses in Frameworks
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-08-18
    Oleg Karpenkov

    Consider a realization of a graph in the space with straight segments representing edges. Let us assign a stress for every its edge. In case if at every vertex of the graph the stresses sum up to zero, we say that the realization is a tensegrity. Some realizations possess non-zero tensegrities while the others do not. In this paper we study necessary and sufficient existence conditions for tensegrities

  • The $$h^*$$ h ∗ -Polynomials of Locally Anti-Blocking Lattice Polytopes and Their $$\gamma $$ γ -Positivity
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-08-12
    Hidefumi Ohsugi, Akiyoshi Tsuchiya

    A lattice polytope \(\mathscr {P} \subset \mathbb {R}^d\) is called a locally anti-blocking polytope if for any closed orthant \({\mathbb R}^d_{\varepsilon }\) in \(\mathbb {R}^d\), \(\mathscr {P} \cap \mathbb {R}^d_{\varepsilon }\) is unimodularly equivalent to an anti-blocking polytope by reflections of coordinate hyperplanes. We give a formula for the \(h^*\)-polynomials of locally anti-blocking

  • Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-08-11
    Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote

    We study the following separation problem: Given a collection of pairwise disjoint coloured objects in the plane with k different colours, compute a shortest “fence” F, i.e., a union of curves of minimum total length, that separates every pair of objects of different colours. Two objects are separated if F contains a simple closed curve that has one object in the interior and the other in the exterior

  • Local Conditions for Triangulating Submanifolds of Euclidean Space
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-08-10
    Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, Mathijs Wintraecken

    We consider the following setting: suppose that we are given a manifold M in \({\mathbb {R}}^d\) with positive reach. Moreover assume that we have an embedded simplical complex \({\mathcal {A}}\) without boundary, whose vertex set lies on the manifold, is sufficiently dense and such that all simplices in \({\mathcal {A}}\) have sufficient quality. We prove that if, locally, interiors of the projection

  • A Spanner for the Day After
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-08-06
    Kevin Buchin, Sariel Har-Peled, Dániel Oláh

    We show how to construct a \((1+\varepsilon )\)-spanner over a set \({P}\) of n points in \({\mathbb {R}}^d\) that is resilient to a catastrophic failure of nodes. Specifically, for prescribed parameters \({\vartheta },\varepsilon \in (0,1)\), the computed spanner \({G}\) has $$\begin{aligned} {{\mathcal {O}}}\bigl (\varepsilon ^{-O(d)} {\vartheta }^{-6} n(\log \log n)^6 \log n \bigr ) \end{aligned}$$

  • A Fast Shortest Path Algorithm on Terrain-like Graphs
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-08-04
    Vincent Froese, Malte Renken

    Terrain visibility graphs are a well-known graph class in computational geometry. They are closely related to polygon visibility graphs, but a precise graph-theoretical characterization is still unknown. Over the last decade, terrain visibility graphs attracted considerable attention in the context of time series analysis (there called time series visibility graphs) with various practical applications

  • Computing the Fréchet Gap Distance
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-08-03
    Chenglin Fan, Benjamin Raichel

    Measuring the similarity of two polygonal curves is a fundamental computational task. Among alternatives, the Fréchet distance is one of the most well-studied similarity measures. Informally, the Fréchet distance is described as the minimum leash length required for a man on one of the curves to walk a dog on the other curve continuously from the starting to the ending points. In this paper we study

  • On Grids in Point-Line Arrangements in the Plane
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-29
    Mozhgan Mirzaei, Andrew Suk

    The famous Szemerédi–Trotter theorem states that any arrangement of n points and n lines in the plane determines \(O(n^{4/3})\) incidences, and this bound is tight. In this paper, we prove the following Turán-type result for point-line incidence. Let \(\mathcal {L}_a\) and \(\mathcal {L}_b\) be two sets of t lines in the plane and let \(P=\{\ell _a \cap \ell _b : \ell _a \in \mathcal {L}_a, \,\ell

  • Dynamic Geometric Data Structures via Shallow Cuttings
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-24
    Timothy M. Chan

    We present new results on a number of fundamental problems about dynamic geometric data structures: (1) We describe the first fully dynamic data structures with sublinear amortized update time for maintaining (i) the number of vertices or the volume of the convex hull of a 3D point set, (ii) the largest empty circle for a 2D point set, (iii) the Hausdorff distance between two 2D point sets, (iv) the

  • Reconstruction of Convex Bodies from Moments
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-22
    Astrid Kousholt, Julia Schulte

    We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments, and we show that among all convex bodies, those which are uniquely determined by a finite number of moments form a dense set. Further, we derive a stability result

  • On the Number of Perfect Triangles with a Fixed Angle
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-20
    Mehdi Makhul

    Richard Guy asked the following question: can we find a triangle with rational sides, medians and area? Such a triangle is called a perfect triangle and no example has been found to date. It is widely believed that such a triangle does not exist. Here we use the setup of Solymosi and de Zeeuw about rational distance sets contained in an algebraic curve, to show that for any angle \(0<\theta < \pi \)

  • Eliminating Depth Cycles Among Triangles in Three Dimensions
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-14
    Boris Aronov, Edward Y. Miller, Micha Sharir

    The vertical depth relation among n pairwise openly disjoint triangles in 3-space may contain cycles. We show that, for any \(\varepsilon >0\), the triangles can be cut into \(O(n^{3/2+\varepsilon })\) connected semialgebraic pieces, whose description complexity depends only on the choice of \(\varepsilon \), such that the depth relation among these pieces is now a proper partial order. This bound

  • On Weak $$\epsilon $$ ϵ -Nets and the Radon Number
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-13
    Shay Moran, Amir Yehudayoff

    We show that the Radon number characterizes the existence of weak nets in separable convexity spaces (an abstraction of the Euclidean notion of convexity). The construction of weak nets when the Radon number is finite is based on Helly’s property and on metric properties of VC classes. The lower bound on the size of weak nets when the Radon number is large relies on the chromatic number of the Kneser

  • On the Number of Weakly Connected Subdigraphs in Random k NN Digraphs
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-06
    Selim Bahadır, Elvan Ceyhan

    We study the number of copies of a weakly connected subdigraph of the k nearest neighbor (kNN) digraph based on data from certain random point processes in \(\mathbb {R}^d\). In particular, based on the asymptotic theory for functionals of point sets from homogeneous Poisson process (HPP) and uniform binomial process (UBP), we provide a general result for the asymptotic behavior of the number of weakly

  • Computing Min-Convex Hulls in the Affine Building of $$\hbox {SL}_d$$ SL d
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-06
    Leon Zhang

    We describe an algorithm for computing the min-convex hull of a finite collection of points in the affine building of \(\hbox {SL}_d(K)\), for K a field with discrete valuation. These min-convex hulls describe the relations among a finite collection of invertible matrices over K. As a consequence, we bound the dimension of the tropical projective space needed to realize the min-convex hull as a tropical

  • Finding Needles in a Haystack
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-06
    Árpád Kurusa

    Convex polygons are distinguishable among the piecewise \(C^\infty \) convex domains by comparing their visual angle functions on any surrounding circle. This is a consequence of our main result, that every segment in a \(C^\infty \) multicurve can be reconstructed from the masking function of the multicurve given on any surrounding circle.

  • The Graphs Behind Reuleaux Polyhedra
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-07-06
    Luis Montejano, Eric Pauli, Miguel Raggi, Edgardo Roldán-Pensado

    This work is about graphs arising from Reuleaux polyhedra. Such graphs must necessarily be planar, 3-connected and strongly self-dual. We study the question of when these conditions are sufficient. If G is any such graph, each vertex has an opposite face with isomorphism \(\tau :G \rightarrow G^*\) (where \(G^*\) is the unique dual graph), a metric mapping is a map \(\eta :V(G) \rightarrow \mathbb

  • Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-06-24
    Haitao Wang, Jie Xue

    We revisit a classical graph-theoretic problem, the single-source shortest-path (SSSP) problem, in weighted unit-disk graphs. We first propose an exact (and deterministic) algorithm which solves the problem in \(O(n\log ^2\!n)\) time using linear space, where n is the number of the vertices of the graph. This significantly improves the previous deterministic algorithm by Cabello and Jejčič [CGTA’15]

  • Constructing Planar Support for Non-Piercing Regions
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-06-22
    Rajiv Raman, Saurabh Ray

    Given a hypergraph \(\mathcal {H}=(X,{\mathcal {S}})\), a planar support for \(\mathcal {H}\) is a planar graph G with vertex set X, such that for each hyperedge \(S\in \mathcal {S}\), the subgraph of G induced by the vertices in S is connected. Planar supports for hypergraphs have found several algorithmic applications, including several packing and covering problems, hypergraph coloring, and in hypergraph

  • The Schläfli Fan
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-06-22
    Michael Joswig, Marta Panizzut, Bernd Sturmfels

    Smooth tropical cubic surfaces are parametrized by maximal cones in the unimodular secondary fan of the triple tetrahedron. There are \(344\, 843 \,867\) such cones, organized into a database of \(14\,373\,645\) symmetry classes. The Schläfli fan gives a further refinement of these cones. It reveals all possible patterns of lines on tropical cubic surfaces, thus serving as a combinatorial base space

  • Theorems of Carathéodory, Helly, and Tverberg Without Dimension
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-06-19
    Karim Adiprasito, Imre Bárány, Nabil H. Mustafa, Tamás Terpai

    We initiate the study of no-dimensional versions of classical theorems in convexity. One example is Carathéodory’s theorem without dimension: given an n-element set P in a Euclidean space, a point \(a \in {{\,\mathrm{{\texttt {conv}}}\,}}P\), and an integer \(r \le n\), there is a subset \(Q\subset P\) of r elements such that the distance between a and \({{\,\mathrm{{\texttt {conv}}}\,}}Q\) is less

  • Discrete Equidecomposability and Ehrhart Theory of Polygons
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-06-10
    Paxton Turner, Yuhuai Wu

    Motivated by questions from Ehrhart theory, we present new results on discrete equidecomposability. Two rational polygons P and Q are said to be discretely equidecomposable if there exists a piecewise affine-unimodular bijection (equivalently, a piecewise affine-linear bijection that preserves the integer lattice \({\mathbb {Z}}^2\)) from P to Q. We develop an invariant for a particular version of

  • Almost All String Graphs are Intersection Graphs of Plane Convex Sets
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-06-05
    János Pach, Bruce Reed, Yelena Yuditsky

    A string graph is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the following structure theorem conjectured by Janson and Uzzell: The vertex set of almost all string graphs on n vertices can be partitioned into five cliques such that some pair

  • An Exploration of Locally Spherical Regular Hypertopes
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-06-03
    Maria Elisa Fernandes, Dimitri Leemans, Asia Ivić Weiss

    Hypertope is a generalization of the concept of polytope, which in turn generalizes the concept of a map and hypermap, to higher rank objects. Regular hypertopes with spherical residues, which we call regular locally spherical hypertopes, must be either of spherical, euclidean, or hyperbolic type. That is, the type-preserving automorphism group of a locally spherical regular hypertope is a quotient

  • Intersection Patterns of Planar Sets
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-06-02
    Gil Kalai, Zuzana Patáková

    Let \({\mathcal {A}}=\{A_1,\ldots ,A_n\}\) be a family of sets in the plane. For \(0 \le i < n\), denote by \(f_i\) the number of subsets \(\sigma \) of \(\{1,\ldots ,n\}\) of cardinality \(i+1\) that satisfy \(\bigcap _{i \in \sigma } A_i \ne \emptyset \). Let \(k \ge 2\) be an integer. We prove that if each k-wise and \((k{+}1)\)-wise intersection of sets from \({\mathcal {A}}\) is empty, or a single

  • Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-05-29
    Adam Brown, Bei Wang

    We investigate a sheaf-theoretic interpretation of stratification learning from geometric and topological perspectives. Our main result is the construction of stratification learning algorithms framed in terms of a sheaf on a partially ordered set with the Alexandroff topology. We prove that the resulting decomposition is the unique minimal stratification for which the strata are homogeneous and the

  • On the Number of Monochromatic Lines in $$\pmb {\mathbb {R}}^d$$Rd
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-05-27
    Mario Huicochea

    Let X be a nonempty finite subset of \({\mathbb {R}}^d\) and \(X=\bigcup _{i=1}^m X_i\) a coloring with \(m

  • Symmetric Non-Negative Forms and Sums of Squares
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-05-21
    Grigoriy Blekherman, Cordian Riener

    We study symmetric non-negative forms and their relationship with symmetric sums of squares. For a fixed number of variables n and degree 2d, symmetric non-negative forms and symmetric sums of squares form closed, convex cones in the vector space of n-variate symmetric forms of degree 2d. Using representation theory of the symmetric group we characterize both cones in a uniform way. Further, we investigate

  • Admissible Complexes for the Projective X-ray Transform over a Finite Field
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-05-09
    David V. Feldman, Eric L. Grinberg

    We consider the X-ray transform in a projective space over a finite field. It is well known (after Bolker) that this transform is injective. We formulate an analog of Gelfand’s admissibility problem for the Radon transform, which asks for a classification of all minimal sets of lines for which the restricted Radon transform is injective. The solution involves doubly ruled quadric surfaces.

  • Simple Realizability of Complete Abstract Topological Graphs Simplified
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-05-04
    Jan Kynčl

    An abstract topological graph (briefly an AT-graph) is a pair \(A=(G,{\mathcal {X}})\) where \(G=(V,E)\) is a graph and \({\mathcal {X}}\subseteq {E \atopwithdelims ()2}\) is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from \({\mathcal {X}}\) crosses exactly once and no other pair crosses. We show that simply realizable

  • Random Sampling with Removal
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-03-31
    Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák

    We study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator spaces; and a setting we introduce, consistent spaces. Such algorithms typically involve a step of finding the optimal solution for a random sample of the constraints. They exploit the condition that, in finite dimension

  • Tri-partitions and Bases of an Ordered Complex
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-03-20
    Herbert Edelsbrunner, Katharina Ölsböck

    Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholtz–Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral complex, K, and every dimension, p, there is a partition of the set of p-cells into a maximal p-tree, a maximal p-cotree, and a collection of p-cells whose cardinality

  • Correction to: On the Links of Vertices in Simplicial d -Complexes Embeddable in the Euclidean 2 d -Space
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-03-16
    Salman Parsa

    In the following we refer to the original paper [1]. The main reason for writing this correction is the incorrect statement.

  • On Polyatomic Tomography over Abelian Groups: Some Remarks on Consistency, Tree Packings and Complexity
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-02-02
    Peter Gritzmann, Barbara Langfeld

    The paper deals with an inverse problem of reconstructing matrices from their marginal sums. More precisely, we are interested in the existence of \(r\times s\) matrices for which only the following information is available: The entries belong to known subsets of c distinguishable abelian groups, and the row and column sums of all entries from each group are given. This generalizes Ryser’s classical

  • Treetopes and Their Graphs
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2020-01-25
    David Eppstein

    We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet which intersects every face of dimension greater than one in more than one point. We prove an equivalent characterization of the 4-treetopes using the concept of clustered planarity from graph drawing, and we use this

  • Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2019-12-17
    Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir

    This work is motivated by several basic problems and techniques that rely on space decomposition of arrangements of hyperplanes in high-dimensional spaces, most notably Meiser’s 1993 algorithm (Meiser in Inf Comput 106(2):286–303, 1993) for point location in such arrangements. A standard approach to these problems is via random sampling, in which one draws a random sample of the hyperplanes, constructs

  • Barycentric Subdivisions of Convex Complexes are Collapsible
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2019-11-19
    Karim Adiprasito, Bruno Benedetti

    A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for \(d \le 3\). We solve the problem up to one subdivision, by proving that any linear subdivision of any polytope is simplicially collapsible after at most one barycentric subdivision. Furthermore

  • Ordered and Convex Geometric Trees with Linear Extremal Function
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2019-11-09
    Zoltán Füredi, Alexandr Kostochka, Dhruv Mubayi, Jacques Verstraëte

    The extremal functions \(\mathrm{{ex}}_{\rightarrow }(n,F)\) and \(\mathrm{{ex}}_{\circlearrowright }(n,F)\) for ordered and convex geometric acyclic graphs F have been extensively investigated by a number of researchers. Basic questions are to determine when \(\mathrm{{ex}}_{\rightarrow }(n,F)\) and \(\mathrm{{ex}}_{\circlearrowright }(n,F)\) are linear in n, the latter posed by Brass–Károlyi–Valtr

  • From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2019-11-04
    Alexander Pilz, Emo Welzl, Manuel Wettstein

    A set \(P = H \cup \{w\}\) of \(n+1\) points in general position in the plane is called a wheel set if all points but w are extreme. We show that for the purpose of counting crossing-free geometric graphs on such a set P, it suffices to know the frequency vector of P. While there are roughly \(2^n\) distinct order types that correspond to wheel sets, the number of frequency vectors is only about \(2^{n/2}\)

  • On open and closed convex codes.
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2018-12-13
    Joshua Cruz,Chad Giusti,Vladimir Itskov,Bill Kronholm

    Neural codes serve as a language for neurons in the brain. Open (or closed) convex codes, which arise from the pattern of intersections of collections of open (or closed) convex sets in Euclidean space, are of particular relevance to neuroscience. Not every code is open or closed convex, however, and the combinatorial properties of a code that determine its realization by such sets are still poorly

  • On Sets Defining Few Ordinary Circles.
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2017-12-30
    Aaron Lin,Mehdi Makhul,Hossein Nassajian Mojarrad,Josef Schicho,Konrad Swanepoel,Frank de Zeeuw

    An ordinary circle of a set P of n points in the plane is defined as a circle that contains exactly three points of P. We show that if P is not contained in a line or a circle, then P spans at least [Formula: see text] ordinary circles. Moreover, we determine the exact minimum number of ordinary circles for all sufficiently large n and describe all point sets that come close to this minimum. We also

  • On the Densest Packing of Polycylinders in Any Dimension.
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2016-04-14
    Wöden Kusner

    Using transversality and a dimension reduction argument, a result of Bezdek and Kuperberg is applied to polycylinders, showing that the optimal packing density of [Formula: see text] equals [Formula: see text] for all natural numbers n.

  • Liftings and stresses for planar periodic frameworks.
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2016-03-15
    Ciprian Borcea,Ileana Streinu

    We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic properties for planar periodic pseudo-triangulations, generalizing features known for their finite counterparts. These properties are then applied to questions originating

  • Gain-Sparsity and Symmetry-Forced Rigidity in the Plane.
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2016-02-24
    Tibor Jordán,Viktória E Kaszanitzky,Shin-Ichi Tanigawa

    We consider planar bar-and-joint frameworks with discrete point group symmetry in which the joint positions are as generic as possible subject to the symmetry constraint. We provide combinatorial characterizations for symmetry-forced rigidity of such structures with rotation symmetry or dihedral symmetry of order 2k with odd k, unifying and extending previous work on this subject. We also explore the

  • Coloring [Formula: see text]-Embeddable [Formula: see text]-Uniform Hypergraphs.
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2014-11-25
    Carl Georg Heise,Konstantinos Panagiotou,Oleg Pikhurko,Anusch Taraz

    This paper extends the scenario of the Four Color Theorem in the following way. Let [Formula: see text] be the set of all [Formula: see text]-uniform hypergraphs that can be (linearly) embedded into [Formula: see text]. We investigate lower and upper bounds on the maximum (weak) chromatic number of hypergraphs in [Formula: see text]. For example, we can prove that for [Formula: see text] there are

  • Reconstruction Using Witness Complexes.
    Discret. Comput. Geom. (IF 0.621) Pub Date : 2008-10-01
    Leonidas J Guibas,Steve Y Oudot

    We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different scales. At a high level, our method is very similar in spirit to Chew's surface meshing algorithm, with one notable difference though: the restricted Delaunay triangulation is replaced by the witness complex, which makes our

  • Poisson-Delaunay Mosaics of Order k.
    Discret. Comput. Geom. (IF 0.621) Pub Date : null
    Herbert Edelsbrunner,Anton Nikitenko

    The order-k Voronoi tessellation of a locally finite set X ⊆ R n decomposes R n into convex domains whose points have the same k nearest neighbors in X. Assuming X is a stationary Poisson point process, we give explicit formulas for the expected number and total area of faces of a given dimension per unit volume of space. We also develop a relaxed version of discrete Morse theory and generalize by

  • Barcodes of Towers and a Streaming Algorithm for Persistent Homology.
    Discret. Comput. Geom. (IF 0.621) Pub Date : null
    Michael Kerber,Hannah Schreiber

    A tower is a sequence of simplicial complexes connected by simplicial maps. We show how to compute a filtration, a sequence of nested simplicial complexes, with the same persistent barcode as the tower. Our approach is based on the coning strategy by Dey et al. (SoCG, 2014). We show that a variant of this approach yields a filtration that is asymptotically only marginally larger than the tower and

Contents have been reproduced by permission of the publishers.
Springer 纳米技术权威期刊征稿
ACS ES&T Engineering
ACS ES&T Water
ACS Publications填问卷