Computational topology and normal surfaces: Theoretical and experimental complexity bounds

Self-archived: 13 April 2013

This page hosts my self-archived (and free) version of the following paper:

Computational topology and normal surfaces: Theoretical and experimental complexity bounds (with João Paixão and Jonathan Spreer)
ALENEX 2013: Proceedings of the Meeting on Algorithm Engineering & Experiments
SIAM, 2013, pp. 78–87.
 
Click here to download the paper.

The content of the self-archived version is essentially the same as for the published version, and references have been brought up-to-date where appropriate.

The copyright holder is SIAM, and the original publication is available at knowledgecenter.siam.org.

(Back to publications list...)