A5041225170- Computational Geometry and Mesh Generation
- Advanced Numerical Analysis Techniques
- Digital Image Processing Techniques
- Polynomial and algebraic computation
- Computer Graphics and Visualization Techniques
- Robotic Path Planning Algorithms
- 3D Shape Modeling and Analysis
- Data Management and Algorithms
- Point processes and geometric inequalities
- Coding theory and cryptography
- Robotics and Sensor-Based Localization
- Mathematics and Applications
- Advanced Materials and Mechanics
- Advanced Graph Theory Research
- Formal Methods in Verification
- Numerical Methods and Algorithms
- Robotic Mechanisms and Dynamics
- 3D Modeling in Geospatial Applications
- Algorithms and Data Compression
- Topological and Geometric Data Analysis
- Cryptography and Residue Arithmetic
- Modular Robots and Swarm Intelligence
- Structural Analysis and Optimization
- VLSI and FPGA Design Techniques
- Advanced Theoretical and Applied Studies in Material Sciences and Geometry
Computer Algorithms for Medicine
2007-2023
Centre National de la Recherche Scientifique
2001-2020
Laboratoire Lorrain de Recherche en Informatique et ses Applications
2006-2020
Université de Lorraine
2005-2020
Institut national de recherche en informatique et en automatique
2005-2016
Centre Inria de l'Université de Lorraine
1999-2014
Geometric (India)
2000-2013
McGill University
1998-1999
Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let $\poly$ convex polygon with n vertices. We study collision-free, optimal path-planning problem for between two configurations inside $\poly$. (A configuration specifies both location direction of travel.) present an O(n2 log n) time algorithm determining whether collision-free exists given configurations. If such exists, returns shortest one. provide detailed classification...
We consider the problem of computing shortest paths having curvature at most one almost everywhere and visiting a sequence $n$ points in plane given order. This is subproblem Dubins traveling salesman also arises naturally path planning for point car-like robots presence polygonal obstacles. show that when consecutive waypoints are distance least four apart, this question reduces to family convex optimization problems over polyhedra $\mathbb{R}^n$.
We give a complete description of the Voronoi diagram three lines in R3. In particular, we show that topology is invariant for general position, is, are pairwise skew and not all parallel to common plane. The trisector consists four unbounded branches either non-singular quartic or cubic line do intersect real space. Each cell dimension two connected components on hyperbolic paraboloid bounded, respectively, by one trisector. proof technique, which relies heavily upon modern tools computer...
We revisit the problem of computing topology and geometry a real algebraic plane curve. The is prime interest but geometric information, such as position singular critical points, also relevant. A challenge to compute efficiently this information for given coordinate system even if curve not in generic position.
In most layered additive manufacturing processes, a tool solidifies or deposits material while following pre-planned trajectories to form solid beads. Many interesting problems arise in this context, among which one concerns the planning of for filling planar shape as densely possible. This is problem we tackle present paper. Recent works have shown that allowing bead width vary along helps increase density. We novel technique that, given deposition range, constructs set closed beads whose...
In this paper, we present the first exact, robust and practical method for computing an explicit representation of intersection two arbitrary quadrics whose coefficients are rational. Combining results from theory quadratic forms, linear algebra number theory, show how to obtain parametric curves that near-optimal in depth radicals involved.
Article A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract) Share on Authors: Jean-Daniel Boissonnat INRIA, BP 93, 06902 Sophia Antipolis Cedex, France FranceView Profile , Sylvain Lazard Authors Info & Claims SCG '96: Proceedings the twelfth annual symposium Computational geometryMay 1996 Pages 242–251https://doi.org/10.1145/237218.237393Online:01 May 1996Publication History 21citation666DownloadsMetricsTotal...
We study the problem of computing free space ${\cal F}$ a simple legged robot called spider robot. The body this is single point and legs are attached to body. subject two constraints: each leg has maximal extension R (accessibility constraint) must lie above convex hull its feet (stability constraint). Moreover, can only put on some regions, foothold regions. ${\mathcal{F}}$ set positions such that there exists accessible footholds for which stable. present an efficient algorithm computes...