Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Francis Avnaim

dblp:63/1287 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 4 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Computational geometry · 100%
Artificial intelligence
1 paper
Motion planning and robot control · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry
geometric predicates
0.011995
Evaluation of a New Method to Compute Signs of Determinants · SCG 1995
Computational geometry › robust geometric computation
sign of determinant
0.011995
Evaluation of a New Method to Compute Signs of Determinants · SCG 1995
Robotics › Motion planning and robot control › motion planning › configuration space
configuration space computation
0.011988
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles · ICRA 1988
Robotics › Motion planning and robot control › motion planning › contact planning
contact motion planning
0.011988
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles · ICRA 1988
Robotics › Motion planning and robot control
motion planning
0.011988
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles · ICRA 1988
Computational geometry › polygon algorithms
polygon containment
0.011987
Simultaneous Containment of Several Polygons · SCG 1987

Methods — techniques the papers use, named apart from their topics

numerical computation · 0.0exact geometric computation · 0.0geometric algorithms · 0.0
YearPublicationVenuePosition
1997 Evaluating Signs of Determinants Using Single-Precision Arithmetic
Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec
Algorithmica1
1995 Evaluation of a New Method to Compute Signs of Determinants
abstract
No abstract available.
Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec
SCG1
1988 A geometric approach to inspection
abstract
An exact solution is presented to the following inspection problem in two dimensions. A manufactured part is desired to have a polygonal shape E/sub d/. Tolerances are given in terms of two polygons, one, called E/sup -/ lying within E/sub d/, and the other, called E/sup +/, lying outside E/sub d/. A vision system yields a description of each manufactured part as a polygon I. It is desired to determine whether I can be translated and rotated to lie between the tolerance polygons E/sup -/ and E/sup +/, in which case the part is considered to conform to the desired tolerances.>
Francis Avnaim, Jean-Daniel Boissonnat
ICPR1
1988 A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
abstract
A general and simple algorithm is presented which computes the set FP of all free configurations for a polygonal object I (with m edges) which is free to translate and/or to rotate but not to intersect another polygonal object E. The worst-case time complexity of the algorithm is O(m/sup 3/n/sup 3/ log mn), which is close to optimal. FP is a three-dimensional curved object which can be used to find free motions within the same time bounds. Two types of motion have been studied in some detail. Motion in contact, where I remains in contact with E, is performed by moving along the faces of the boundary of FP. By partitioning FP into prisms, it is possible to compute motions when I never makes contact with E. In this case, the theoretical complexity does not exceed O(m/sup 6/n/sup 6/ alpha (mn)) but it is expected to be much smaller in practice. In both cases, pseudo-optimal motions can be obtained with a complexity increased by a factor log mn.>
Francis Avnaim, Jean-Daniel Boissonnat, Bernard Faverjon
ICRA1
1988 Polygon Placement Under Translation and Rotation
Francis Avnaim, Jean-Daniel Boissonnat
STACS1
1987 Simultaneous Containment of Several Polygons
abstract
Article Free Access Share on Simultaneous containment of several polygons Authors: F. Avnaim INRIA, Avenue Emile Hugues, 06565 VALBONNE INRIA, Avenue Emile Hugues, 06565 VALBONNEView Profile , J. Bsissonnat INRIA, Avenue Emile Hugues, 06565 VALBONNE INRIA, Avenue Emile Hugues, 06565 VALBONNEView Profile Authors Info & Claims SCG '87: Proceedings of the third annual symposium on Computational geometryOctober 1987 Pages 242–247https://doi.org/10.1145/41958.41984Published:01 October 1987Publication History 21citation325DownloadsMetricsTotal Citations21Total Downloads325Last 12 Months7Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Francis Avnaim, Jean-Daniel Boissonnat
SCG1