AI Chat AI Image Generator AI Video Text to Speech

Plane drawings of the generalized Delaunay-graphs for pseudo-disks

06/11/2018

∙

by Balázs Keszegh, et al.

∙

∙

We study general Delaunay-graphs, which are a natural generalizations of Delaunay triangulations to arbitrary families. We prove that for any finite pseudo-disk family and point set, there is a plane drawing of their Delaunay-graph such that every edge lies inside every pseudo-disk that contains its endpoints.

Balázs Keszegh
13 publications
Dömötör Pálvölgyi
16 publications

page 1

page 2

page 3

page 4

research

∙ 02/28/2023

On the geometric thickness of 2-degenerate graphs

A graph is 2-degenerate if every subgraph contains a vertex of degree at...

0 Rahul Jain, et al. ∙

research

∙ 08/25/2020

Simple Topological Drawings of k-Planar Graphs

Every finite graph admits a simple (topological) drawing, that is, a dra...

0 Michael Hoffmann, et al. ∙

research

∙ 02/24/2018

On Pseudo-disk Hypergraphs

Let F be a family of pseudo-disks in the plane, and P be a finite subset...

0 Boris Aronov, et al. ∙

research

∙ 02/23/2021

On the number of hyperedges in the hypergraph of lines and pseudo-discs

Consider the hypergraph whose vertex set is a family of n lines in gener...

0 Chaya Keller, et al. ∙

research

∙ 01/23/2020

Arrangements of Approaching Pseudo-Lines

We consider arrangements of n pseudo-lines in the Euclidean plane where ...

0 Stefan Felsner, et al. ∙

research

∙ 02/13/2022

Pseudo-finiteness of arbitrary graphs of bounded shrub-depth

We consider classes of arbitrary (finite or infinite) graphs of bounded ...

0 Abhisekh Sankaran, et al. ∙

research

∙ 06/04/2018

Strong Pseudo Transitivity and Intersection Graphs

A directed graph G=(V,E) is strongly pseudo transitive if there is a pa...

0 Farhad Shahrokhi, et al. ∙