E-LIB Suche - Ergebnisse für: Devillers, O.

1

On the complexity of umbra and penumbra:

Demouth, J. ; Devillers, O. ; Everett, H....
Computational Geometry. 42 (2009) 8 - p. 758-771 , 2009

Link: https://doi.org/10.1016/..

2

Succinct representations of planar maps:

Castelli Aleardi, L. ; Devillers, O. ; Schaeffer, G.
Theoretical Computer Science. 408 (2008) 2-3 - p. 174-187 , 2008

Link: https://doi.org/10.1016/..

3

Lines Tangent to Four Triangles in Three-Dimensional Space:

Bronnimann, H. ; Devillers, O. ; Lazard, S..
Discrete & Computational Geometry. 37 (2007) 3 - p. 369-380 , 2007

Link: https://doi.org/10.1007/..

4

The number of lines tangent to arbitrary convex polyhedra i..:

, In: Proceedings of the twentieth annual symposium on Computational geometry,

Brönnimann, H. ; Devillers, O. ; Dujmović, V.... - p. 46-55 , 2004

Link: https://dl.acm.org/doi/1..

5

Circular Separability of Polygons:

-D. Boissonnat, J. ; Czyzowicz, J. ; Devillers, O..
Algorithmica. 30 (2001) 1 - p. 67-82 , 2001

Link: https://doi.org/10.1007/..

6

A Probabilistic Analysis of the Power of Arithmetic Filters:

Devillers, O. ; Preparata, F. P.
Discrete & Computational Geometry. 20 (1998) 4 - p. 523-547 , 1998

Link: https://doi.org/10.1007/..

7

Evaluating signs of determinants using single-precision ari..:

Avnaim, F. ; Boissonnat, J. -D. ; Devillers, O...
Algorithmica. 17 (1997) 2 - p. 111-132 , 1997

Link: https://doi.org/10.1007/..

8

Queries on Voronoi diagrams of moving points:

Devillers, O. ; Golin, M. ; Kedem, K..
Computational Geometry. 6 (1996) 5 - p. 315-327 , 1996

Link: https://doi.org/10.1016/..

9

Evaluation of a new method to compute signs of determinants:

, In: Proceedings of the eleventh annual symposium on Computational geometry,

Avnaim, F. ; Boissonnat, J.-D. ; Devillers, O... - p. 416-417 , 1995

Link: https://dl.acm.org/doi/1..

10

Applications of Random Sampling to On-Line Algorithms in Co..:

Boissonnat, J.D. ; Devillers, O. ; Schott, R..
Discrete & Computational Geometry. 8 (1992) - p. , 1992

Link: http://www.digizeitschri..

11

Stable placements for spider robots:

, In: Proceedings of the eighth annual symposium on Computational geometry,

Boissonnat, J.-D. ; Devillers, O. ; Donati, L.. - p. 242-250 , 1992

Link: https://dl.acm.org/doi/1..

12

Vertex deletion for 3D Delaunay triangulations:

Buchin, KA Kevin ; Devillers, O ; Mulzer, W.. , 2013

Link: http://repository.tue.nl..

13

Computing the maximum overlap of two convex polygons under ..:

Berg, MT Mark de ; Cheong, Otfried ; Devillers, O..
ISSN:1432-4350. , 1998

Link: http://repository.tue.nl..

14

Computing a single cell in the union of two simple polygons:

de Berg, M.T ; Devillers, O ; Dobrindt, K.
0020-0190. , 1997

Link: https://dspace.library.u..

15

Computing a single cell in the overlay of two simple polygo..:

Berg, MT Mark de ; Devillers, O ; Dobrindt, KTG Katrin.
ISSN:0020-0190. , 1997

Link: http://repository.tue.nl..