4 papers
cs.CG2026
Rerouting Curves on Surfaces
Timo Brand, Stefan Felsner, Henry Förster +8
We study the problem of reconfiguring a crossing-free embedding of a graph on a surface, with edges represented as curves, into another crossing-free embedding of the same graph on…
cs.CG2024
Noncrossing Longest Paths and Cycles
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose +7
Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short…
cs.CG2002
Computational Geometry Column 43
Joseph O'Rourke
The concept of pointed pseudo-triangulations is defined and a few of its applications described.
cs.CG2000
Computational Geometry Column 38
Joseph O'Rourke
Recent results on curve reconstruction are described.