default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Schirra
Person information
- affiliation: Otto von Guericke University of Magdeburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Maximum Polygon Packing: The CG: SHOP Challenge 2024. CoRR abs/2403.16203 (2024)- 2023
- [j16]Sándor P. Fekete
, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. ACM J. Exp. Algorithmics 28: 1.9:1-1.9:13 (2023) - [i4]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Minimum Coverage by Convex Polygons: The CG: SHOP Challenge 2023. CoRR abs/2303.07007 (2023) - 2022
- [i3]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Minimum Partition into Plane Subgraphs: The CG: SHOP Challenge 2022. CoRR abs/2203.07444 (2022) - 2020
- [j15]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89: 101631 (2020)
2010 – 2019
- 2017
- [c32]Stefan Schirra, Martin Wilhelm:
On Interval Methods with Zero Rewriting and Exact Geometric Computation. MACIS 2017: 211-226 - [c31]Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. WADS 2017: 301-312 - 2016
- [i2]Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut. CoRR abs/1612.01370 (2016) - 2015
- [c30]Marc Mörig, Stefan Schirra:
Precision-Driven Computation in the Evaluation of Expression-Dags with Common Subexpressions: Problems and Solutions. MACIS 2015: 451-465 - 2014
- [c29]Stefan Schirra:
On the Use of Adaptive, Exact Decisions Number Types Based on Expression-Dags in Geometric Computing. CCCG 2014 - 2013
- [j14]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. J. Comput. Geom. 4(1): 182-211 (2013) - [c28]Stefan Schirra:
A Note on Sekigawa's Zero Separation Bound. CASC 2013: 331-339 - [i1]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. CoRR abs/1304.1909 (2013) - 2010
- [j13]Marc Mörig, Ivo Rössling, Stefan Schirra:
On Design and Implementation of a Generic Number Type for Real Algebraic Number Computations Based on Expression Dags. Math. Comput. Sci. 4(4): 539-556 (2010) - [c27]Matthias Müller-Hannemann, Stefan Schirra:
Foundations of Algorithm Engineering. Algorithm Engineering 2010: 1-15 - [c26]Matthias Müller-Hannemann, Stefan Schirra:
Challenges in Algorithm Engineering. Algorithm Engineering 2010: 446-453 - [e1]Matthias Müller-Hannemann, Stefan Schirra:
Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar]. Lecture Notes in Computer Science 5971, Springer 2010, ISBN 978-3-642-14865-1 [contents]
2000 – 2009
- 2009
- [j12]Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt:
A Separation Bound for Real Algebraic Expressions. Algorithmica 55(1): 14-28 (2009) - [c25]Stefan Schirra:
Much Ado about Zero. Efficient Algorithms 2009: 408-421 - 2008
- [j11]Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
Classroom examples of robustness problems in geometric computations. Comput. Geom. 40(1): 61-78 (2008) - [c24]Stefan Schirra:
How Reliable Are Practical Point-in-Polygon Strategies? ESA 2008: 744-755 - 2007
- [c23]Marc Mörig, Stefan Schirra:
On the Design and Performance of Reliable Geometric Predicates using Error-free Transformations and Exact Sign of Sum Algorithms. CCCG 2007: 45-48 - 2006
- [c22]Jan Tusch, Stefan Schirra:
Experimental Comparison of the Cost of Approximate and Exact Convex Hull Computation in the Plane. CCCG 2006 - [c21]Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
Reply to "Backward Error Analysis ...". ICCSA (1) 2006: 60-60 - 2005
- [c20]Stefan Schirra:
Feasibility of the Exact Geometric Computation Paradigm for Largest Empty Anchored Cylinder Computation in the Plane. CCCG 2005: 171-174 - 2004
- [c19]Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
Classroom Examples of Robustness Problems in Geometric Computations. ESA 2004: 702-713 - 2002
- [j10]Mark de Berg, Stefan Schirra:
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 12(1-2): 1-2 (2002) - 2001
- [j9]Richard Cole, Kirstin Ost, Stefan Schirra:
Edge-Coloring Bipartite Multigraphs in O(E log D) Time. Comb. 21(1): 5-12 (2001) - [c18]Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt:
A Separation Bound for Real Algebraic Expressions. ESA 2001: 254-265 - [p3]Kurt Mehlhorn, Stefan Schirra:
Exact Computation with leda_real - Theory and geometric Applications. Symbolic Algebraic Methods and Verification Methods 2001: 163-172 - 2000
- [j8]Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica 27(1): 87-99 (2000) - [j7]Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr:
On the design of CGAL a computational geometry algorithms library. Softw. Pract. Exp. 30(11): 1167-1202 (2000) - [p2]Stefan Schirra:
Robustness and Precision Issues in Geometric Computation. Handbook of Computational Geometry 2000: 597-632
1990 – 1999
- 1999
- [j6]Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig:
Checking geometric programs or verification of geometric structures. Comput. Geom. 12(1-2): 85-103 (1999) - [c17]Stefan Schirra:
A Case Study on the Cost of Geometric Computing. ALENEX 1999: 156-176 - [c16]Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
Efficient Exact Geometric Computation Made Easy. SCG 1999: 341-350 - 1998
- [j5]Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler:
A computational basis for higher-dimensional computational geometry and applications. Comput. Geom. 10(4): 289-303 (1998) - [c15]Hervé Brönnimann, Lutz Kettner, Stefan Schirra, Remco C. Veltkamp:
Applications of the Generic Programming Paradigm in the Design of CGAL. Generic Programming 1998: 206-217 - 1997
- [c14]Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler:
A Computational Basis for Higher-Dimensional Computational Geometry and Applications. SCG 1997: 254-263 - [c13]Jörg Schwerdt, Michiel H. M. Smid, Stefan Schirra:
Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search. SCG 1997: 466-468 - [c12]Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. SODA 1997: 702-709 - 1996
- [j4]Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra:
Queries on Voronoi Diagrams of Moving Points. Comput. Geom. 6: 315-327 (1996) - [c11]Kamala Krithivasan, Anna Rema, Stefan Schirra, P. I. Vijaykumar:
Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles. CCCG 1996: 149-154 - [c10]Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig:
Checking Geometric Programs or Verification of Geometric Structures. SCG 1996: 159-165 - [c9]Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr:
The CGAL Kernel: A Basis for Geometric Computation. WACG 1996: 191-202 - [p1]Stefan Schirra:
Precision and Robustness in Geometric Computations. Algorithmic Foundations of Geographic Information Systems 1996: 255-287 - 1995
- [c8]Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Exact Geometric Computation in LEDA. SCG 1995: C18-C19 - 1994
- [j3]Paul J. Heffernan, Stefan Schirra:
Approximate Decision Algorithms for Point Set Congruence. Comput. Geom. 4: 137-156 (1994) - [c7]Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra:
Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. CCCG 1994: 122-127 - [c6]Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra:
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. ESA 1994: 227-239 - [c5]Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra:
On Degeneracy in Geometric Computations. SODA 1994: 16-23 - 1993
- [c4]Stefan Schirra:
Moving a Disc Between Polygons. SCG 1993: 395-396 - 1992
- [b1]Stefan Schirra:
Approximative Bewegungsplanungsverfahren. Saarland University, Saarbrücken, Germany, 1992, pp. I-V, 1-127 - [j2]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8(5&6): 391-406 (1992) - [j1]Stefan Schirra:
Approximate Decision Algorithms for Approximate Congruence. Inf. Process. Lett. 43(1): 29-34 (1992) - [c3]Paul J. Heffernan, Stefan Schirra:
Approximate Decision Algorithms for Point Set Congruence. SCG 1992: 93-101 - [c2]Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig:
Selected Topics from Computational Geometry, Data Structures and Motion Planning. Data Structures and Efficient Algorithms 1992: 25-43 - 1990
- [c1]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. SCG 1990: 281-289
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 01:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
