Buscar
Mostrando ítems 1-5 de 5
Ponencia
Triangulations without pointed spanning trees
(2004)
Problem 50 in the Open Problems Project asks whether any triangulation on a point set in the plane contains a pointed spanning tree as a subgraph. We provide a counterexample. As a consequence we show that there ...
Ponencia
Simulating distributed algorithms for lattice agents
(2013)
We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2-and 3-dimensional square/cubic lattice-based agents. This AgentSystem assumes that each agent is capable to change position ...
Ponencia
On the number of pseudo-triangulations of certain point sets
(2004)
We compute the exact number of pseudo-triangulations for two prominent point sets, namely the so-called double circle and the double chain. We also derive a new asymptotic lower bound for the maximal number of pseudotriangulations ...
Ponencia
A quadratic distance bound on sliding between crossing-free spanning trees
(2004)
Let S be a set of n points in the plane and let TS be the set of all crossing-free spanning trees of S. We show that any two trees in TS can be transformed into each other by O(n2) local and constant-size edge slide ...
Ponencia
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
(2013)
In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combinatorial 4-PPT is stretchable to a geometric ...