Embedding Ray Intersection Graphs and Global Curve Simplification

by   Mees van de Kerkhof, et al.
Utrecht University
TU Eindhoven

We prove that circle graphs (intersection graphs of circle chords) can be embedded as intersection graphs of rays in the plane with polynomial-size bit complexity. We use this embedding to show that the global curve simplification problem for the directed Hausdorff distance is NP-hard. In this problem, we are given a polygonal curve P and the goal is to find a second polygonal curve P' such that the directed Hausdorff distance from P' to P is at most a given constant, and the complexity of P' is as small as possible.


page 1

page 2

page 3

page 4


What Makes the Recognition Problem Hard for Classes Related to Segment and String graphs?

We explore what could make recognition of particular intersection-define...

A topological characterization of Gauss codes

A (smooth) embedding of a closed curve on the plane with finitely many i...

An adaptive iterative/subdivision hybrid algorithm for curve/curve intersection

The behavior of the iterative/subdivision hybrid algorithm for curve/cur...

Intersection multiplicity of a sparse curve and a low-degree curve

Let F(x, y) ∈C[x,y] be a polynomial of degree d and let G(x,y) ∈C[x,y] b...

Computing the intersection of two quadrics through projection and lifting

This paper is devoted to presenting a method to determine the intersecti...

Removing Popular Faces in Curve Arrangements

A face in a curve arrangement is called popular if it is bounded by the ...

Using symbolic computation to prove nonexistence of distance-regular graphs

A package for the Sage computer algebra system is developed for checking...

Please sign up or login with your details

Forgot password? Click here to reset