Sweeping and maintaining two-dimensional arrangements on surfaces: a first step

  • Authors:
  • Eric Berberich;Efi Fogel;Dan Halperin;Kurt Mehlhorn;Ron Wein

  • Affiliations:
  • Max-Planck-Institut für Informatik, Saarbrücken, Germany;School of Computer Science, Tel-Aviv University, Israel;School of Computer Science, Tel-Aviv University, Israel;Max-Planck-Institut für Informatik, Saarbrücken, Germany;School of Computer Science, Tel-Aviv University, Israel

  • Venue:
  • ESA'07 Proceedings of the 15th annual European conference on Algorithms
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce a general framework for sweeping a set of curves embedded on a two-dimensional parametric surface. We can handle planes, cylinders, spheres, tori, and surfaces homeomorphic to them. A major goal of our work is to maximize code reuse by generalizing the prevalent sweep-line paradigm and its implementation so that it can be employed on a large class of surfaces and curves embedded on them. We have realized our approach as a prototypical CGAL package. We present experimental results for two concrete adaptations of the framework: (i) arrangements of arcs of great circles embedded on a sphere, and (ii) arrangements of intersection curves between quadric surfaces embedded on a quadric.