- feeds
- popular
- recent
- reader
- about
- story
- technologies
- what is rss
- connect
- dmca
- contact
- Feed Preview Journal of Computational Geometry
Asymptotic improvements on the exact matching distance for $2$-parameter persistence
In the field of topological data analysis, persistence modules are used to express geometrical features of data sets. The matching distance $d_mathcal{M}$ measures the difference between $2$-para...
Unit-disk range searching and applications
Given a set $P$ of $n$ points in the plane, we consider the problem of computing the number of points of $P$ in a query unit disk (i.e., all query disks have the same radius). We show that the ma...
Constructing many faces in arrangements of lines and segments
We present new algorithms for computing many faces in arrangements of lines and segments. Given a set $S$ of $n$ lines (resp., segments) and a set $P$ of $m$ points in the plane, the problem is t...
Approximate vertex enumeration
The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull proble...
Geometric algorithms for sampling the flux space of metabolic networks
Metabolic networks and their reconstruction set a new era in the analysis of metabolic and growth functions in the various organisms. By modeling the reactions occurring inside an organism, metab...
A coupled alpha complex
The alpha complex is a subset of the Delaunay triangulation and is often used in computational geometry and topology. One of the main drawbacks of using the alpha complex is that it is non-monoto...
Recognizing and realizing inductively pierced codes
We prove algebraic and combinatorial characterizations of the class of inductively pierced codes, resolving a conjecture of Gross, Obatake, and Youngs. Starting from an algebraic invariant of a...
A 10-Approximation of the π/2 -MST
Bounded-angle spanning trees of points in the plane have received considerable attention in the context of wireless networks with directional antennas. For a point set P in the plane and an angle...
On the independence number of intersection graphs of axis-parallel segments
We prove that for any triangle-free intersection graph of $n$ axis-parallel line segments in the plane, the independence number $alpha$ of this graph is at least $alpha ge n/4 + Omega(sqrt{n})$. ...
The Gromov-Hausdorff distance between ultrametric spaces: its structure and computation
$DeclareMathOperator{ugh}{u_mathrm{GH}}DeclareMathOperator{dgh}{d_mathrm{GH}}$The Gromov-Hausdorff distance ($d_mathrm{GH}$) provides a natural way of quantifying the dissimilarity between two gi...
An SPQR-tree-like embedding representation for level planarity
An SPQR-tree is a data structure that efficiently represents all planar embeddings of a connected planar graph. It is a key tool in a number of constrained planarity testing algorithms, which ...
Reverse shortest path problem for unit-disk graphs
Given a set P of n points in the plane, the unit-disk graph Gr(P) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two points p, q in P if the...
Approximating longest spanning tree with neighborhoods
We study the following maximization problem in the Euclidean plane: Given a collection of neighborhoods (polygonal regions) in the plane, the goal is to select a point in each neighborhood so tha...