Precision in Geometric Algorithms (Dagstuhl Seminar 25372)

Abrahamsen, Mikkel; Kisfaludi-Bak, Sándor; Kleist, Linda; Miltzow, Till

doi:10.4230/DagRep.15.9.21

Document

Precision in Geometric Algorithms (Dagstuhl Seminar 25372)

Authors Mikkel Abrahamsen, Sándor Kisfaludi-Bak, Linda Kleist, Till Miltzow and all authors of the abstracts in this report

Part of: Issue: Dagstuhl Reports, Volume 15, Issue 9
Part of: Volume: Dagstuhl Reports, Volume 15
Part of: Journal: Dagstuhl Reports (DagRep)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2026-05-08

PDF

File

PDF

DagRep.15.9.21.pdf

Filesize: 2.65 MB
17 pages

Document Identifiers

DOI: 10.4230/DagRep.15.9.21
URN: urn:nbn:de:0030-drops-249807

Subject Classification

ACM Subject Classification

Theory of computation → Design and analysis of algorithms

Keywords

Computational Geometry
Real Complexity Theory

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

Document

0

Metadata

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 25372 "Precision in Geometric Algorithms". This seminar was an opportunity for a get together of researchers interested in geometric problems that require high precision of the coordinates to find a correct solution.

Cite As Get BibTex

Mikkel Abrahamsen, Sándor Kisfaludi-Bak, Linda Kleist, and Till Miltzow. Precision in Geometric Algorithms (Dagstuhl Seminar 25372). In Dagstuhl Reports, Volume 15, Issue 9, pp. 21-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/DagRep.15.9.21

Author Details

Mikkel Abrahamsen

University of Copenhagen, DK

Sándor Kisfaludi-Bak

Aalto University, FI

Linda Kleist

Universität Hamburg, DE

Till Miltzow

Utrecht University, NL

and all authors of the abstracts in this report

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail