2008 | ||
---|---|---|
113 | EE | Olivier Devillers, Jeff Erickson, Xavier Goaoc: Empty-ellipse graphs. SODA 2008: 1249-1257 |
112 | EE | Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc: Helly-type theorems for approximate covering. Symposium on Computational Geometry 2008: 120-128 |
111 | EE | Olivier Devillers, Marc Glisse, Sylvain Lazard: Predicates for line transversals to lines and line segments in three-dimensional space. Symposium on Computational Geometry 2008: 174-181 |
110 | EE | Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer: Succinct representations of planar maps. Theor. Comput. Sci. 408(2-3): 174-187 (2008) |
2007 | ||
109 | EE | Jane Tournois, Pierre Alliez, Olivier Devillers: Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation. IMR 2007: 83-101 |
108 | EE | Nina Amenta, Dominique Attali, Olivier Devillers: Complexity of Delaunay triangulation for points on lower-dimensional polyhedra. SODA 2007: 1106-1113 |
107 | EE | Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel: Between umbra and penumbra. Symposium on Computational Geometry 2007: 265-274 |
106 | EE | Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile: Lines Tangent to Four Triangles in Three-Dimensional Space. Discrete & Computational Geometry 37(3): 369-380 (2007) |
105 | EE | Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath: Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. Int. J. Comput. Geometry Appl. 17(4): 297-304 (2007) |
104 | EE | Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37(2): 522-551 (2007) |
2006 | ||
103 | EE | Abdelkrim Mebarki, Luca Castelli Aleardi, Olivier Devillers: 2D Triangulation Representation Using Stable Catalogs. CCCG 2006 |
102 | EE | Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer: Optimal succinct representations of planar maps. Symposium on Computational Geometry 2006: 309-318 |
101 | EE | Olivier Devillers, Philippe Guigue: Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions CoRR abs/cs/0604059: (2006) |
100 | EE | Olivier Devillers, Philippe Guigue: Inner and outer rounding of Boolean operations on lattice polygonal regions. Comput. Geom. 33(1-2): 3-17 (2006) |
99 | EE | Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath: Drawing Kn in Three Dimensions with One Bend per Edge. J. Graph Algorithms Appl. 10(2): 287-295 (2006) |
2005 | ||
98 | EE | Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer: Dynamic updates of succinct triangulations. CCCG 2005: 134-137 |
97 | EE | Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath: Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. CCCG 2005: 302-305 |
96 | EE | Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath: Drawing Kn in Three Dimensions with One Bend Per Edge. Graph Drawing 2005: 83-88 |
95 | EE | Abdelkrim Mebarki, Pierre Alliez, Olivier Devillers: Farthest Point Seeding for Efficient Placement of Streamlines. IEEE Visualization 2005: 61 |
94 | EE | Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer: Succinct Representation of Triangulations with a Boundary. WADS 2005: 134-145 |
93 | EE | Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg: Centroidal Voronoi diagrams for isotropic surface remeshing. Graphical Models 67(3): 204-231 (2005) |
2004 | ||
92 | EE | Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile: On the number of line tangents to four triangles in three-dimensional space. CCCG 2004: 184-187 |
91 | EE | Olivier Devillers, Philippe Guigue: Inner and outer rounding of set operations on lattice polygonal regions. Symposium on Computational Geometry 2004: 429-437 |
90 | EE | Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: The number of lines tangent to arbitrary convex polyhedra in 3D. Symposium on Computational Geometry 2004: 46-55 |
2003 | ||
89 | Olivier Devillers, Sylvain Pion: Efficient Exact Geometric Predicates for Delauny Triangulations. ALENEX 2003: 37-44 | |
88 | EE | Olivier Devillers, Monique Teillaud: Perturbations and vertex removal in a 3D delaunay triangulation. SODA 2003: 313-319 |
87 | EE | Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg: Isotropic Surface Remeshing. Shape Modeling International 2003: 49-58 |
86 | EE | Pierre Alliez, David Cohen-Steiner, Olivier Devillers, Bruno Lévy, Mathieu Desbrun: Anisotropic polygonal remeshing. ACM Trans. Graph. 22(3): 485-493 (2003) |
85 | EE | Olivier Devillers, Ferran Hurtado, Gyula Károlyi, Carlos Seara: Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position. Comput. Geom. 26(3): 193-208 (2003) |
84 | EE | Olivier Devillers: The Number of Cylindrical Shells. Discrete & Computational Geometry 30(3): 453-458 (2003) |
83 | EE | Olivier Devillers, Franco P. Preparata: Culling a Set of Points for Roundness or Cylindricity Evaluations. Int. J. Comput. Geometry Appl. 13(3): 231-240 (2003) |
82 | EE | Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro A. Ramos, Vera Sacristan: Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction. Int. J. Comput. Geometry Appl. 13(5): 391-398 (2003) |
81 | EE | Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean: The Expected Number of 3D Visibility Events Is Linear. SIAM J. Comput. 32(6): 1586-1620 (2003) |
2002 | ||
80 | EE | Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117 |
79 | EE | Pierre-Marie Gandoin, Olivier Devillers: Progressive lossless compression of arbitrary simplicial complexes. SIGGRAPH 2002: 372-379 |
78 | EE | Pierre-Marie Gandoin, Olivier Devillers: Progressive lossless compression of arbitrary simplicial complexes. ACM Trans. Graph. 21(3): 372-379 (2002) |
77 | EE | Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud: Splitting a Delaunay Triangulation in Linear Time. Algorithmica 34(1): 39-46 (2002) |
76 | Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud: Algebraic methods and arithmetic filtering for exact predicates on circle arcs. Comput. Geom. 22(1-3): 119-142 (2002) | |
75 | Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Pion, Monique Teillaud, Mariette Yvinec: Triangulations in CGAL. Comput. Geom. 22(1-3): 5-19 (2002) | |
74 | EE | Olivier Devillers: On Deletion in Delaunay Triangulations. Int. J. Comput. Geometry Appl. 12(3): 193-206 (2002) |
73 | EE | Olivier Devillers, Pedro A. Ramos: Computing Roundness is Easy if the Set is Almost Round. Int. J. Comput. Geometry Appl. 12(3): 229-248 (2002) |
72 | EE | Olivier Devillers: The Delaunay Hierarchy. Int. J. Found. Comput. Sci. 13(2): 163-180 (2002) |
71 | EE | Olivier Devillers, Sylvain Pion, Monique Teillaud: Walking in a Triangulation. Int. J. Found. Comput. Sci. 13(2): 181-199 (2002) |
70 | EE | Olivier Devillers, Pierre-Marie Gandoin: Rounding Voronoi diagram. Theor. Comput. Sci. 283(1): 203-221 (2002) |
2001 | ||
69 | EE | Olivier Devillers, Philippe Guigue: The shuffling buffer. CCCG 2001: 77-80 |
68 | EE | Olivier Devillers, Ferran Hurtado, Mercè Mora, Carlos Seara: Separating several point sets in the plane. CCCG 2001: 81-84 |
67 | EE | Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud: Splitting a Delaunay Triangulation in Linear Time. ESA 2001: 312-320 |
66 | EE | Olivier Devillers, Sylvain Pion, Monique Teillaud: Walking in a triangulation. Symposium on Computational Geometry 2001: 106-114 |
65 | EE | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec: Circular Separability of Polygons. Algorithmica 30(1): 67-82 (2001) |
64 | Olivier Devillers, Philippe Guigue: The Shuffling Buffer. Int. J. Comput. Geometry Appl. 11(5): 555-572 (2001) | |
2000 | ||
63 | Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud: Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs. EWCG 2000: 117-120 | |
62 | EE | Olivier Devillers, Pierre-Marie Gandoin: Geometric compression for interactive transmission. IEEE Visualization 2000: 319-326 |
61 | EE | Olivier Devillers, Franco P. Preparata: Evaluating the cylindricity of a nominally cylindrical point set. SODA 2000: 518-527 |
60 | EE | Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, Mariette Yvinec: Triangulations in CGAL (extended abstract). Symposium on Computational Geometry 2000: 11-18 |
59 | EE | Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud: Algebraic methods and arithmetic filtering for exact predicates on circle arcs. Symposium on Computational Geometry 2000: 139-147 |
58 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec: Computing Largest Circles Separating Two Sets of Segments. Int. J. Comput. Geometry Appl. 10(1): 41-53 (2000) | |
57 | EE | Pierre Alliez, Olivier Devillers, Jack Snoeyink: Removing Degeneracies by Perturbing the Problem or Perturbing the World. Reliable Computing 6(1): 61-79 (2000) |
56 | Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard: Motion Planning of Legged Robots. SIAM J. Comput. 30(1): 218-246 (2000) | |
1999 | ||
55 | EE | Olivier Devillers, Pierre-Marie Gandoin: Rounding Voronoi Diagram. DGCI 1999: 375-387 |
54 | EE | Olivier Devillers: On Deletion in Delaunay Triangulations. Symposium on Computational Geometry 1999: 181-188 |
53 | EE | Jean-Daniel Boissonnat, Frédéric Cazals, Frank Da, Olivier Devillers, Sylvain Pion, François Rebufat, Monique Teillaud, Mariette Yvinec: Programming with CGAL: The Example of Triangulations. Symposium on Computational Geometry 1999: 421-422 |
52 | EE | Olivier Devillers: On Deletion in Delaunay Triangulation CoRR cs.CG/9907023: (1999) |
51 | EE | Olivier Devillers: Improved Incremental Randomized Delaunay Triangulation CoRR cs.CG/9907024: (1999) |
50 | EE | Hervé Brönnimann, Olivier Devillers: The union of unit balls has quadratic complexity, even if they all contain the origin CoRR cs.CG/9907025: (1999) |
49 | EE | Olivier Devillers, Franco P. Preparata: Further Results on Arithmetic Filters for Geometric Predicates CoRR cs.CG/9907028: (1999) |
48 | EE | Olivier Devillers, Franco P. Preparata: A Probabilistic Analysis of the Power of Arithmetic Filters CoRR cs.CG/9907029: (1999) |
47 | EE | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec: Convex Tours of Bounded Curvature CoRR cs.CG/9909004: (1999) |
46 | EE | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec: Computing largest circles separating two sets of segments CoRR cs.CG/9909005: (1999) |
45 | EE | Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard: Motion Planning of Legged Robots CoRR cs.CG/9909006: (1999) |
44 | EE | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec: Circular Separability of Polygons CoRR cs.CG/9909007: (1999) |
43 | EE | Olivier Devillers, Asish Mukhopadhyay: Finding an ordinary conic and an ordinary hyperplane CoRR cs.CG/9909017: (1999) |
42 | EE | Olivier Devillers, Pierre-Marie Gandoin: Geometric compression for progressive transmission CoRR cs.CG/9909018: (1999) |
41 | Olivier Devillers, Franco P. Preparata: Further results on arithmetic filters for geometric predicates. Comput. Geom. 13(2): 141-148 (1999) | |
40 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec: Convex tours of bounded curvature. Comput. Geom. 13(3): 149-159 (1999) | |
39 | Olivier Devillers, Matthew J. Katz: Optimal Line Bipartitions of Point Sets. Int. J. Comput. Geometry Appl. 9(1): 39-51 (1999) | |
38 | Olivier Devillers, Asish Mukhopadhyay: Finding an Ordinary Conic and an Ordinary Hyperplane. Nord. J. Comput. 6(4): 462-468 (1999) | |
1998 | ||
37 | EE | Pierre Alliez, Olivier Devillers, Jack Snoeyink: Removing degeneracies by perturbing the problem or perturbing the world. CCCG 1998 |
36 | EE | Olivier Devillers: Improved Incremental Randomized Delaunay Triangulation. Symposium on Computational Geometry 1998: 106-115 |
35 | EE | Olivier Devillers: Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems CoRR cs.CG/9810007: (1998) |
34 | Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. 11(3-4): 187-208 (1998) | |
33 | EE | Olivier Devillers, Franco P. Preparata: A Probabilistic Analysis of the Power of Arithmetic Filters. Discrete & Computational Geometry 20(4): 523-547 (1998) |
32 | Olivier Devillers, Mordecai J. Golin: Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. Int. J. Comput. Geometry Appl. 8(3): 321-342 (1998) | |
31 | EE | Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud: Computing the Maximum Overlap of Two Convex Polygons under Translations. Theory Comput. Syst. 31(5): 613-628 (1998) |
1997 | ||
30 | Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). WADS 1997: 186-199 | |
29 | Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec: Evaluating Signs of Determinants Using Single-Precision Arithmetic. Algorithmica 17(2): 111-132 (1997) | |
28 | EE | Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf: Computing a Single Cell in the Overlay of Two Simple Polygons. Inf. Process. Lett. 63(4): 215-219 (1997) |
1996 | ||
27 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec: Computing Largest Circles Separating Two Sets of Segments. CCCG 1996: 173-178 | |
26 | Olivier Devillers: Computational geometry and discrete computations. DGCI 1996: 317-324 | |
25 | Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud: Computing the Maximum Overlap of Two Convex Polygons Under Translations. ISAAC 1996: 126-135 | |
24 | Olivier Devillers, Matthew J. Katz: Optimal Line Bipartitions of Point Sets. ISAAC 1996: 45-54 | |
23 | Jean-Daniel Boissonnat, André Cérézo, Olivier Devillers, Jacqueline Duquesne, Mariette Yvinec: An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D. Comput. Geom. 6: 123-130 (1996) | |
22 | Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra: Queries on Voronoi Diagrams of Moving Points. Comput. Geom. 6: 315-327 (1996) | |
21 | Jean-Daniel Boissonnat, André Cérézo, Olivier Devillers, Monique Teillaud: Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes. Int. J. Comput. Geometry Appl. 6(1): 1-14 (1996) | |
20 | Olivier Devillers, Andreas Fabri: Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. Int. J. Comput. Geometry Appl. 6(4): 487-506 (1996) | |
19 | EE | Olivier Devillers: An Introduction to Randomization in Computational Geometry. Theor. Comput. Sci. 157(1): 35-52 (1996) |
1995 | ||
18 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec: Circular Separability of Polygon. SODA 1995: 273-281 | |
17 | EE | Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec: Evaluation of a New Method to Compute Signs of Determinants. Symposium on Computational Geometry 1995: C16-C17 |
16 | EE | Olivier Devillers, Mordecai J. Golin: Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. Inf. Process. Lett. 56(3): 157-164 (1995) |
15 | Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata: Motion planning of legged robots: the spider robot problem. Int. J. Comput. Geometry Appl. 5: 3-20 (1995) | |
1994 | ||
14 | Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra: Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. CCCG 1994: 122-127 | |
13 | Olivier Devillers, Mordecai J. Golin: Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. CCCG 1994: 153-158 | |
12 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec: Convex Tours on Bounded Curvature. ESA 1994: 254-265 | |
11 | Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard: From Spider Robots to Half Disk Robots. ICRA 1994: 953-958 | |
1993 | ||
10 | Olivier Devillers, Mordecai J. Golin: Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. ESA 1993: 133-144 | |
9 | Olivier Devillers, Andreas Fabri: Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers. WADS 1993: 277-288 | |
8 | Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud: A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis. Algorithmica 9(4): 329-356 (1993) | |
7 | Olivier Devillers: Simultaneous containment of several polygons: analysis of the contact configurations. Int. J. Comput. Geometry Appl. 3(4): 429-442 (1993) | |
1992 | ||
6 | EE | Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata: Stable Placements for Spider Robots. Symposium on Computational Geometry 1992: 242-250 |
5 | Olivier Devillers, Stefan Meiser, Monique Teillaud: Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation. Comput. Geom. 2: 55-80 (1992) | |
4 | Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec: Applications of Random Sampling to On-line Algorithms in Computational Geometry. Discrete & Computational Geometry 8: 51-71 (1992) | |
3 | Olivier Devillers: Randomization yields simple O(n log* n) algorithms for difficult Omega(n) problems. Int. J. Comput. Geometry Appl. 2(1): 97-111 (1992) | |
1991 | ||
2 | Olivier Devillers, Stefan Meiser, Monique Teillaud: Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation. WADS 1991: 42-53 | |
1 | Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata: Computing the union of 3-colored triangles. Int. J. Comput. Geometry Appl. 1(2): 187-196 (1991) |