Ponències/Comunicacions de congressos
Enviaments recents
-
Compatible Paths on Labelled Point Sets
(2019)
Text en actes de congrés
Accés obertLet P and Q be finite point sets of the same cardinality in R 2 , each labelled from 1 to n. Two noncrossing geometric graphs GP and GQ spanning P and Q, respectively, are called compatible if for every face f in GP , there ... -
Pole Dancing: 3D Morphs for Tree Drawings
Text en actes de congrés
Accés restringit per política de l'editorialWe study the question whether a crossing-free 3D morph between two straight-line drawings of an n-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the ... -
Sequences of spanning trees for L-infinity Delaunay triangulations
(2018)
Text en actes de congrés
Accés obertWe extend a known result about L2-Delaunay triangulations to L∞-Delaunay. Let TS be the set of all non-crossing spanning trees of a planar n-point set S. We prove that for each element T of TS, there exists a length-decreasing ... -
Computing optimal shortcuts for networks
(2018)
Text en actes de congrés
Accés obertWe augment a plane Euclidean network with a segment or shortcut to minimize the largest distance between any two points along the edges of the resulting network. In this continuous setting, the problem of computing distances ... -
Computing optimal shortcuts for networks
(2018)
Text en actes de congrés
Accés obertWe study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Questions of this type have received considerable ... -
A new lower bound on the maximum number of plane graphs using production matrices
(2018)
Comunicació de congrés
Accés restringit per política de l'editorialWe use the concept of production matrices to show that there exist sets of n points in the plane that admit ¿(41.77n) crossing-free geometric graphs. This improves the previously best known bound of ¿(41.18n) by Aichholzer ... -
Non-crossing paths with geographic constraints
(Springer, 2018)
Text en actes de congrés
Accés restringit per política de l'editorialA geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic ... -
Geomasking through perturbation, or counting points in circles
(2017)
Text en actes de congrés
Accés restringit per política de l'editorialMotivated by a technique in privacy protection, in which n points are randomly perturbed by at most a distance r, we study the following problem: Given n points and m circles in the plane, what is the maximum r such that ...
RSS 1.0