![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Günther Eder
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Günther Eder
, Martin Held
, Stefan de Lorenzo
, Peter Palfrader
:
On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs. Comput. Geom. 109: 101935 (2023) - 2022
- [j12]Günther Eder
, Martin Held
, Steinþór Jasonarson, Philipp Mayer, Peter Palfrader:
2-Opt Moves and Flips for Area-optimal Polygonizations. ACM J. Exp. Algorithmics 27: 2.7:1-2.7:12 (2022) - 2021
- [j11]Günther Eder
:
Projective duality and the Rise of Modern Logic. Bull. Symb. Log. 27(4): 351-384 (2021) - [j10]Günther Eder
, Martin Held
, Peter Palfrader
:
Implementing straight skeletons with exact arithmetic: Challenges and experiences. Comput. Geom. 96: 101760 (2021) - [j9]Günther Eder
:
Frege and the origins of model theory in nineteenth century geometry. Synth. 198(6): 5547-5575 (2021) - 2020
- [c3]Günther Eder
, Martin Held
, Peter Palfrader
:
On Implementing Straight Skeletons: Challenges and Experiences. SoCG 2020: 38:1-38:17 - [c2]Günther Eder
, Martin Held
, Peter Palfrader
:
Step-By-Step Straight Skeletons (Media Exposition). SoCG 2020: 76:1-76:4 - [c1]Günther Eder
, Martin Held
, Stefan de Lorenzo
, Peter Palfrader
:
Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge). SoCG 2020: 85:1-85:11
2010 – 2019
- 2019
- [j8]Günther Eder
, Martin Held
:
Weighted Voronoi Diagrams in the Maximum Norm. Int. J. Comput. Geom. Appl. 29(3): 239-250 (2019) - [j7]Günther Eder
, Martin Held, Peter Palfrader:
Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input. Int. J. Comput. Geom. Appl. 29(3): 251-267 (2019) - 2018
- [j6]Günther Eder, Martin Held, Peter Palfrader:
Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons. Comput. Geom. 73: 15-23 (2018) - [j5]Günther Eder
, Martin Held
, Peter Palfrader
:
Min-/Max-Volume Roofs Induced by Bisector Graphs of Polygonal Footprints of Buildings. Int. J. Comput. Geom. Appl. 28(4): 309-340 (2018) - [j4]Günther Eder
, Martin Held:
Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement. Inf. Process. Lett. 132: 28-32 (2018) - [j3]Günther Eder
, Georg Schiemer
:
Hilbert, duality, and the Geometrical roots of Model Theory. Rev. Symb. Log. 11(1): 48-86 (2018) - 2015
- [j2]Günther Eder
, Esther Ramharter
:
Formal reconstructions of St. Anselm's ontological argument. Synth. 192(9): 2795-2825 (2015) - 2014
- [j1]Günther Eder
:
Remarks on Compositionality and Weak Axiomatic Theories of Truth. J. Philos. Log. 43(2-3): 541-547 (2014)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint