default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Berberich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c16]Eric Berberich:
CGAL - Reliable Geometric Computing for Academia and Industry. ICMS 2014: 191-197- [c15]Eric Berberich:
Robustly and Efficiently Computing Algebraic Curves and Surfaces. ICMS 2014: 253-260 - 2013
- [j6]Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Exact symbolic-numeric computation of planar algebraic curves. Theor. Comput. Sci. 491: 1-32 (2013) - 2012
- [j5]Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing Approximate Offsets. Discret. Comput. Geom. 48(4): 964-989 (2012) - [i4]Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Exact Symbolic-Numeric Computation of Planar Algebraic Curves. CoRR abs/1201.1548 (2012) - 2011
- [c14]Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff:
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks. ALENEX 2011: 35-47 - [c13]Eric Berberich, Michael Hemmer, Michael Kerber:
A generic algebraic kernel for non-linear geometric applications. SCG 2011: 179-186 - [c12]Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing approximate offsets. SCG 2011: 187-196 - [c11]Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Arrangement computation for planar algebraic curves. SNC 2011: 88-98 - [i3]Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Arrangement Computation for Planar Algebraic Curves. CoRR abs/1103.4697 (2011) - [i2]Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing Approximate Offsets. CoRR abs/1109.2158 (2011) - 2010
- [j4]Eric Berberich, Michael Kerber, Michael Sagraloff:
An efficient algorithm for the stratification and triangulation of an algebraic surface. Comput. Geom. 43(3): 257-278 (2010) - [j3]Eric Berberich, Efi Fogel
, Dan Halperin, Kurt Mehlhorn, Ron Wein:
Arrangements on Parametric Surfaces I: General Framework and Infrastructure. Math. Comput. Sci. 4(1): 45-66 (2010) - [j2]Eric Berberich, Efi Fogel, Dan Halperin, Michael Kerber, Ophir Setter:
Arrangements on Parametric Surfaces II: Concretizations and Applications. Math. Comput. Sci. 4(1): 67-91 (2010) - [c10]Marc Mörig, Sven Scholz, Tobias Tscheuschner, Eric Berberich:
Implementation Aspects. Algorithm Engineering 2010: 237-289 - [c9]Eric Berberich, Matthias Hagen, Benjamin Hiller, Hannes Moser:
Experiments. Algorithm Engineering 2010: 325-388 - [i1]Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff:
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks. CoRR abs/1010.1386 (2010)
2000 – 2009
- 2009
- [j1]Eric Berberich, Michael Sagraloff:
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces. Comput. Aided Geom. Des. 26(6): 627-647 (2009) - [c8]Pavel Emeliyanenko, Eric Berberich, Michael Sagraloff:
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast. ISVC (1) 2009: 608-619 - 2008
- [b1]Eric Berberich:
Robust and efficient software for problems in 2.5-dimensional non-linear geometry: algorithms and implementations. Saarland University, 2008 - [c7]Eric Berberich, Michael Kerber, Michael Sagraloff:
Exact geometric-topological analysis of algebraic surfaces. SCG 2008: 164-173 - [c6]Eric Berberich, Michael Kerber:
Exact arrangements on tori and Dupin cyclides. Symposium on Solid and Physical Modeling 2008: 59-66 - [c5]Eric Berberich, Michael Sagraloff:
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces. Symposium on Solid and Physical Modeling 2008: 171-182 - 2007
- [c4]Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein:
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA 2007: 645-656 - 2005
- [c3]Eric Berberich, Michael Hemmer, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves. SCG 2005: 99-106 - [c2]Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert:
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. ESA 2005: 155-166 - 2002
- [c1]Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer:
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. ESA 2002: 174-186
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-10-07 22:09 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:
