default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Schorn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1991
[b1]Peter Schorn:
Robust algorithms in a program library for geometric computation. Informatik-Dissertationen ETH Zürich 32, Verl. d. Fachvereine 1991, pp. 1-93
Journal Articles
- 2019
- [j11]Paul Pollack, Peter Schorn:
Dirichlet's proof of the three-square theorem: An algorithmic perspective. Math. Comput. 88(316): 1007-1019 (2019) - 1994
- [j10]Peter Schorn:
Degeneracy in Geometric Computation and the Perturbation Approach. Comput. J. 37(1): 35-42 (1994) - [j9]Peter Schorn:
Evolution of a Software System: Interaction, Interfaces and Applications in the XYZ GeoBench. J. Symb. Comput. 17(4): 311-320 (1994) - 1993
- [j8]Jürg Nievergelt, Peter Schorn:
Numerik des Chaos oder Chaos der Numerik? Über die Aussagekraft von Bildern - Overflow. Inform. Spektrum 16(1): 39-41 (1993) - [j7]Peter Schorn:
An Axiomatic Approach to Robust Geometric Programs. J. Symb. Comput. 16(2): 155-165 (1993) - 1992
- [j6]Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
An All-Round Sweep Algorithm for 2-Dimensional Nearest-Neighbor Problems. Acta Informatica 29(4): 383-394 (1992) - 1989
- [j5]Peter Schorn, Jürg Nievergelt:
Wie wachsen Quad-Bäume? Overflow. Inform. Spektrum 12(2): 97-101 (1989) - 1988
- [j4]Jürg Nievergelt, Peter Schorn:
Das Rätsel der verzopften Geraden - Overflow. Inform. Spektrum 11(3): 163-165 (1988) - [j3]Jürg Nievergelt, Peter Schorn:
Geradenprobleme mit superlinearem Wachstum - Overflow. Inform. Spektrum 11(4): 214-217 (1988) - [j2]Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
Plane-Sweep Solves the Closest Pair Problem Elegantly. Inf. Process. Lett. 26(5): 255-261 (1988) - [j1]Peter Schorn:
A Canonical Simplifier for Trigonometric Expressions in the Kinematic Equation. Inf. Process. Lett. 29(5): 241-246 (1988)
Conference and Workshop Papers
- 1992
- [c5]Peter Schorn:
The XYZ GeoBench for the Experimental Evaluation of Geometric. Computational Support for Discrete Mathematics 1992: 137-151 - 1991
- [c4]Jürg Nievergelt, Peter Schorn, Michele De Lorenzi, Christoph Ammann, Adrian Brüngger:
XYZ: A Project in Experimental Geometric Computation. Workshop on Computational Geometry 1991: 171-186 - [c3]Peter Schorn:
Implementing the XYZ GeoBench: A Programming Environment for Geometric Algorithms. Workshop on Computational Geometry 1991: 187-202 - 1988
- [c2]Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
A Sweep Algorithm for the All-Nearest-Neighbors Problem. Workshop on Computational Geometry 1988: 43-54 - [c1]Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
A Sweep Algorithm and its Implementation: The All-Nearest-Neighbors Problem Revisited. WG 1988: 442-457
Parts in Books or Collections
- 1994
- [p1]Peter Schorn, Frederick Fisher:
Testing the Convexity of a Polygon. Graphics Gems 1994: 7-15
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-04-24 23:10 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:
