English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point

MPS-Authors
/persons/resource/persons44118

Berberich,  Eric
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44766

Kettner,  Lutz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-I-2007-1-001.pdf
(Any fulltext), 189KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Berberich, E., & Kettner, L.(2007). Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point (MPI-I-2007-1-001). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1FB9-8
Abstract
There is no abstract available