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.
We study general Delaunay-graphs, which are natural generalizations of Delaunay triangulations to arbitrary families , in particular to pseudo-disks . 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.
D
a
A
, in particular to pseudo-disks