#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1992

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Frank Dehne, Andreas Fabri, Andrew Rau-Chaplin
- Symposium on Computational Geometry
- 1993

Parallel Computational Geometry is concerned with solving some given geometric problem of size n on a parallel computer with p processors (e.g., a PRAM, mesh, or hypercube multiprocessor) in timeâ€¦ (More)

- Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven SchÃ¶nherr
- Softw., Pract. Exper.
- 2000

CGAL is a Computational Geometry Algorithms Library written in C++, which is being developed by research groups in Europe and Israel. The goal is to make the large body of geometric algorithmsâ€¦ (More)

- Frank Dehne, Andreas Fabri, Andrew Rau-Chaplin
- Int. J. Comput. Geometry Appl.
- 1996

We study scalable parallel computational geometry algorithms for the coarse grained multicomputermodel: p processors solving a problem on n data items, were each processor has O( p ) O(1) localâ€¦ (More)

- Andreas Fabri
- 2001

The Cgal project (www.cgal.org) is a collaborative effort of several research institutes in Europe. The mission of the project is to make the most important of the solutions and methods developed inâ€¦ (More)

- Olivier Devillers, Andreas Fabri
- WADS
- 1993

We present output-sensitive scalable parallel algorithms for bichromatic line segment intersection problems for the coarse grained multicomputer model. Under the assumption that n p 2 , where n isâ€¦ (More)

- Pierre Alliez, Andreas Fabri
- SIGGRAPH Courses
- 2001

This course provides an overview of CGAL geometric algorithms and data structures. We start with a presentation the objectives and scope of the CGAL open source project. The three next parts coverâ€¦ (More)

We present a randomized parallel algorithm for constructing the 3D convex hull on a generic p-processor coarse grained multicomputer with arbitrary interconnection network and n/p local memory perâ€¦ (More)

- Frank Dehne, Claire Mathieu, Andreas Fabri
- SPDP
- 1994

1 Abstract We present parallel computational geometry algorithms that are scalable, architecture independent, easy to implement, and have, with high probability, an optimal time complexity forâ€¦ (More)

- Mikhail J. Atallah, Andreas Fabri
- PARLE
- 1994

We build on the work of Dehne and Rau-Chaplin and give improved bounds for the multisearch problem on a hypercube. This is a parallel search problem where the elements in the structure S to beâ€¦ (More)