C. Tóth

activity

20032022

most citedBounds on the maximum multiplicity of some common geometric graphs

37 citations · 192 across the 51 of their papers we have counts for

collaborators

Showing 2020Show all

5 papers · 1 filter

cs.CG2020

On Euclidean Steiner $(1 + ε)$ -Spanners

Sujoy Bhore, Csaba D. Tóth

Lightness and sparsity are two natural parameters for Euclidean $(1 + ε)$ -spanners. Classical results show that, when the dimension $d \in N$ and $ε > 0$ ar…

cs.CG2020

Polygons with Prescribed Angles in 2D and 3D

Alon Efrat, Radoslav Fulek, Stephen Kobourov +1

We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A = (α_{0}, \dots, α_{n - 1})$ , $α_{i} \in (- π, π)$ , for $i\in\{…

cs.CG2020

Rainbow polygons for colored point sets in the plane

David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval +5

Given a colored point set in the plane, a perfect rainbow polygon is a simple polygon that contains exactly one point of each color, either in its interior or on its boundary. Let…

cs.CG2020

Cutting Polygons into Small Pieces with Chords: Laser-Based Localization

Esther M. Arkin, Rathish Das, Jie Gao +4

Motivated by indoor localization by tripwire lasers, we study the problem of cutting a polygon into small-size pieces, using the chords of the polygon. Several versions are conside…

cs.CG2020★ 1 cited

Compatible Paths on Labelled Point Sets

Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz +8

Let $P$ and $Q$ be finite point sets of the same cardinality in $R^{2}$ , each labelled from $1$ to $n$ . Two noncrossing geometric graphs $G_{P}$ and $G_{Q}$ spanning $P$ and $Q$ …

On Euclidean Steiner (1+ε)-Spanners

Polygons with Prescribed Angles in 2D and 3D

Rainbow polygons for colored point sets in the plane

Cutting Polygons into Small Pieces with Chords: Laser-Based Localization

Compatible Paths on Labelled Point Sets

On Euclidean Steiner $(1 + ε)$ -Spanners