Stefan Schirra

Orcid: 0009-0006-5928-1494

Affiliations:
  • Otto von Guericke University of Magdeburg, Germany


According to our database1, Stefan Schirra authored at least 49 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Maximum Polygon Packing: The CG: SHOP Challenge 2024.
CoRR, 2024

2023
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022.
ACM J. Exp. Algorithmics, December, 2023

Minimum Coverage by Convex Polygons: The CG: SHOP Challenge 2023.
CoRR, 2023

2022
Minimum Partition into Plane Subgraphs: The CG: SHOP Challenge 2022.
CoRR, 2022

2020
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut.
Comput. Geom., 2020

2017
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

On Interval Methods with Zero Rewriting and Exact Geometric Computation.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2015
Precision-Driven Computation in the Evaluation of Expression-Dags with Common Subexpressions: Problems and Solutions.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014
On the Use of Adaptive, Exact Decisions Number Types Based on Expression-Dags in Geometric Computing.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Network Farthest-Point Diagrams.
J. Comput. Geom., 2013

A Note on Sekigawa's Zero Separation Bound.
Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

2010
On Design and Implementation of a Generic Number Type for Real Algebraic Number Computations Based on Expression Dags.
Math. Comput. Sci., 2010

Challenges in Algorithm Engineering.
Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

Foundations of Algorithm Engineering.
Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009
A Separation Bound for Real Algebraic Expressions.
Algorithmica, 2009

Much Ado about Zero.
Proceedings of the Efficient Algorithms, 2009

2008
Classroom examples of robustness problems in geometric computations.
Comput. Geom., 2008

How Reliable Are Practical Point-in-Polygon Strategies?
Proceedings of the Algorithms, 2008

2007
On the Design and Performance of Reliable Geometric Predicates using Error-free Transformations and Exact Sign of Sum Algorithms.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Reply to "Backward Error Analysis ...".
Proceedings of the Computational Science and Its Applications, 2006

Experimental Comparison of the Cost of Approximate and Exact Convex Hull Computation in the Plane.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2002
Guest Editor's Foreword.
Int. J. Comput. Geom. Appl., 2002

2001
Edge-Coloring Bipartite Multigraphs in O(E log D) Time.
Comb., 2001

Exact Computation with leda_real - Theory and geometric Applications.
Proceedings of the Symbolic Algebraic Methods and Verification Methods, 2001

2000
On the design of CGAL a computational geometry algorithms library.
Softw. Pract. Exp., 2000

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals.
Algorithmica, 2000

Robustness and Precision Issues in Geometric Computation.
Proceedings of the Handbook of Computational Geometry, 2000

1999
Checking geometric programs or verification of geometric structures.
Comput. Geom., 1999

Efficient Exact Geometric Computation Made Easy.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

A Case Study on the Cost of Geometric Computing.
Proceedings of the Algorithm Engineering and Experimentation, 1999

1998
A computational basis for higher-dimensional computational geometry and applications.
Comput. Geom., 1998

Applications of the Generic Programming Paradigm in the Design of CGAL.
Proceedings of the Generic Programming, 1998

1997
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Queries on Voronoi Diagrams of Moving Points.
Comput. Geom., 1996

The CGAL Kernel: A Basis for Geometric Computation.
Proceedings of the Applied Computational Geormetry, 1996

Precision and Robustness in Geometric Computations.
Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Exact Geometric Computation in LEDA.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Approximate Decision Algorithms for Point Set Congruence.
Comput. Geom., 1994

On Degeneracy in Geometric Computations.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results.
Proceedings of the Algorithms, 1994

Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Moving a Disc Between Polygons.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992
Approximate Decision Algorithms for Approximate Congruence.
Inf. Process. Lett., 1992

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Algorithmica, 1992

Selected Topics from Computational Geometry, Data Structures and Motion Planning.
Proceedings of the Data Structures and Efficient Algorithms, 1992

Approximative Bewegungsplanungsverfahren.
PhD thesis, 1992


  Loading...