default search action
Andreas Fabri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c13]Pierre Alliez, Andreas Fabri:
CGAL: the computational geometry algorithms library. SIGGRAPH Courses 2016: 8:1-8:8 - 2011
- [j7]Sylvain Pion, Andreas Fabri:
A generic lazy evaluation scheme for exact geometric computations. Sci. Comput. Program. 76(4): 307-323 (2011)
2000 – 2009
- 2009
- [c12]Andreas Fabri, Sylvain Pion:
CGAL: the Computational Geometry Algorithms Library. GIS 2009: 538-539 - [c11]Pierre Alliez, Andreas Fabri:
Computational geometry algorithms library. SIGGRAPH ASIA Courses 2009 - 2008
- [c10]Pierre Alliez, Andreas Fabri, Efi Fogel:
Computational geometry algorithms library. SIGGRAPH Classes 2008: 22:1-22:358 - 2007
- [c9]Andreas Fabri:
Voronoi Diagrams in CGAL, the Computational Geometry Algorithms Library. ISVD 2007: 8-14 - 2006
- [i1]Sylvain Pion, Andreas Fabri:
A Generic Lazy Evaluation Scheme for Exact Geometric Computations. CoRR abs/cs/0608063 (2006) - 2001
- [c8]Andreas Fabri:
CGAL - The Computational Geometry Algorithm Library. IMR 2001 - 2000
- [j6]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) - [c7]Txomin Nieva, Andreas Fabri, Abdenbi Benammour:
Jini Technology Applied to Railway Systems. DOA 2000: 251-
1990 – 1999
- 1997
- [j5]Frank K. H. A. Dehne, Xiaotie Deng, Patrick W. Dymond, Andreas Fabri, Ashfaq A. Khokhar:
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers. Theory Comput. Syst. 30(6): 547-558 (1997) - 1996
- [j4]Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin:
Scalable parallel computational geometry for coarse grained multicomputers. Int. J. Comput. Geom. Appl. 6(3): 379-400 (1996) - [j3]Olivier Devillers, Andreas Fabri:
Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. Int. J. Comput. Geom. Appl. 6(4): 487-506 (1996) - [c6]Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr:
The CGAL Kernel: A Basis for Geometric Computation. WACG 1996: 191-202 - 1995
- [j2]Mikhail J. Atallah, Andreas Fabri:
On the Multisearching Problem for Hypercubes. Comput. Geom. 5: 293-302 (1995) - [c5]Frank K. H. A. Dehne, Xiaotie Deng, Patrick W. Dymond, Andreas Fabri, Ashfaq A. Khokhar:
A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers. SPAA 1995: 27-33 - 1994
- [j1]Frank K. H. A. Dehne, Andreas Fabri, Mostafa Nassar, Andrew Rau-Chaplin, Rada Valiveti:
Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor. J. Parallel Distributed Comput. 23(2): 256-262 (1994) - [c4]Mikhail J. Atallah, Andreas Fabri:
On the Multisearching Problem of Hypercubes. PARLE 1994: 159-166 - [c3]Frank Dehne, Claire Kenyon, Andreas Fabri:
Scalable and architecture independent parallel geometric algorithms with high probability optimal time. SPDP 1994: 586-593 - 1993
- [c2]Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin:
Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. SCG 1993: 298-307 - [c1]Olivier Devillers, Andreas Fabri:
Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers. WADS 1993: 277-288
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:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint