 |
 |
 |
|
|
||
|---|---|---|
| inria-00090675v1
Journal articles
Applications of random sampling to on-line algorithms in computational geometry Discrete and Computational Geometry, Springer Verlag, 1992, 8 (1), pp.51--71. ⟨10.1007/BF02293035⟩ |
||
| hal-01180166v1
Conference papers
An on-line construction of higher-order Voronoi diagrams and its randomized analysis Canadian Conference on Computational Geometry, 1990, Ottawa, Canada. pp.278-281 |
||
| hal-01179417v1
Conference papers
Algebraic methods and arithmetic filtering for exact predicates on circle arcs Proceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.139-147, ⟨10.1145/336154.336194⟩  |
||
| hal-01179898v1
Conference papers
Motion planning for a spider robot IEEE International Conference on Robotics and Automation, 1992, Nice, France. pp.2321-2326 |
||
| hal-01179691v1
Conference papers
Checking the convexity of polytopes and the planarity of subdivisions Workshop Algorithms and Data Structures, 1997, Halifax, Canada. pp.186-199 |
||
| hal-01180164v1
Conference papers
Fully dynamic Delaunay triangulation in logarithmic expected time per operation Workshop Algorithms and Data Structures, 1991, Ottawa, Canada. pp.42-53 |
||
| hal-01180157v1
Conference papers
The space of spheres, a geometric tool to unify duality results on Voronoi diagrams Canadian Conference on Computational Geometry, 1992, St. John's, Canada. pp.263-268 |
||
| hal-01179450v1
Conference papers
Computing the Maximum Overlap of Two Convex Polygons Under Translations International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135 |
||
| hal-01179468v1
Conference papers
Circular separability of polygon Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, ~, United States. pp.273-281 |
||
| hal-01180161v1
Conference papers
On-line geometric algorithms with good expected behaviours 3th World Congress on Computation and Applied Mathematics, 1991, ~, France. pp.137-139 |
||
| hal-01179475v1
Conference papers
Convex Tours of Bounded Curvature Proceedings of the 2nd European Symposium on Algorithms, 1994, Utrecht, Netherlands. pp.254-265, ⟨10.1007/BFb0049413⟩ |
||
| hal-01179699v1
Conference papers
An introduction to randomization in computational geometry Workshop on Algorithmic Complexity of Algebraic and Geometric Models, 1994, ~, France |
||
| hal-01179435v1
Conference papers
On deletion in Delaunay triangulations Proceedings of the 15th Annual Symposium on Computational Geometry, 1999, Miami, United States. pp.181-189, ⟨10.1145/304893.304969⟩ |
||
| hal-01179425v1
Conference papers
Geometric compression for interactive transmission Proceedings of the conference on Visualization '00, 2000, Salt Lake City, United States. pp.319-326, ⟨10.1109/VISUAL.2000.885711⟩ |
||
| hal-01179721v1
Conference papers
Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers Workshop Algorithms and Data Structures, 1993, Montreal, Canada. pp.277-288 |
||
| inria-00072896v1
Reports
Compression géométrique pour une transmission progressive RR-3766, INRIA. 1999 |
||
| inria-00074367v1
Reports
Evaluating signs of determinants using single-precision arithmetic [Research Report] RR-2306, INRIA. 1994 |
||
| inria-00071961v1
Reports
Perturbations and Vertex Removal in a 3D Delaunay Triangulation RR-4624, INRIA. 2002 |
||
| inria-00413159v1
Journal articles
An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d Computational Geometry, Elsevier, 1996, 6, pp.123-130. ⟨10.1016/0925-7721(95)00024-0⟩ |
||
| inria-00074648v1
Reports
A Complete and efficient algorithm for the intersection of a general ans a convex polyhedron [Research Report] RR-2023, INRIA. 1993 |
||
| inria-00076905v1
Reports
Some results on feedback stabilization of a one-link flexible arm [Research Report] RR-1682, INRIA. 1992 |
||
| inria-00074621v1
Reports
Suboptimal paths in the problem of a planar motion with bounded derivative of the curvature [Research Report] RR-2051, INRIA. 1993 |
||
| inria-00074591v1
Reports
An Algorithm for constructing the convex hull of a set of spheres in dimension d [Research Report] RR-2080, INRIA. 1993 |
||
| inria-00442806v1
Conference papers
A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles Symposium on Computational Geometry (SoCG'96), 1996, Philadelphia, United States. pp.242-251, ⟨10.1145/237218.237393⟩ |
||
| inria-00442776v1
Conference papers
From spider robots to half disk robots IEEE International Conference on Robotics and Automation, 1994, San Diego, United States. pp.953-958 |
||
| inria-00442802v1
Conference papers
Convex hulls of bounded curvature Canadian Conference on Computational Geometry (CCCG'96), 1996, Ottawa, Canada. pp.14-19 |
||
| |
||
| tel-00832414v1
Theses
Algorithmes géométriques adaptatifs Géométrie algorithmique [cs.CG]. Université Nice Sophia Antipolis, 1996. Français |
||
| tel-00832312v1
Theses
Vers des algorithmes dynamiques randomisés en géométrie algorithmique Géométrie algorithmique [cs.CG]. Université Paris Sud - Paris XI, 1991. Français |
||
| inria-00615533v1
Journal articles
Efficient Registration of stereo images by matching graph descriptions of edge segments International Journal of Computer Vision, Springer Verlag, 1987, pp.107--131. ⟨10.1007/BF00123161⟩ |
||
|
|
||